GSA Capital Quant Research Internship Second Round Tech Phone Screen
Question Details
Back-to-back interviews, and I failed as expected. The first interviewer was a white-haired man. He asked the Monte Carlo problem: given two distributions, what algorithm is best to estimate P(X<Y)? I
Full Details
Back-to-back interviews, and I failed as expected. The first interviewer was a white-haired man. He asked the Monte Carlo problem: given two distributions, what algorithm is best to estimate P(X
passed. The follow-up was proving that O(n+k) time was insufficient. After thinking for a moment, I drew him a tree and said that if you were counting the number of paths, linear time wouldn't be feasible. He said it was acceptable, but the actual proof might be more rigorous. During the Q&A session, since I felt I should have already submitted my answer, I thought I'd chat with him a bit, having some lighthearted small talk. Then, at some point, he said "see you next time" and immediately hung up. I felt it was right to waste his time on someone like that.
About This Question
This is a reported interview question from a gsa capital interview for a quant role (intern level) during the phone screen round reported in 2026.
It covers the following topics: Tree .