Pitchbook·Software Engineer·Technical Phone Screen
May 2026
Pitchbook software engineer interview with a coding round focused on computational geometry and nearest neighbor search. Two related problems, both building on each other, which felt reasonable in isolation but the second one had some gotchas around tie-breaking that I almost missed.
- Write a function that computes the Euclidean distance between two points in n-dimensional space, where each point is a list of floats.
- Using the distance function you just wrote, implement a k-nearest neighbors lookup that takes a query point, an integer k, and a dataset, and returns the indices of the k closest points sorted by increasing distance. Break ties by smaller index.
“Pretty standard warmup.”