Skip to contentSkip to footer

Quant Interview Questions

Salaries
Interviews

2,927 quant interview questions shared by candidates

- How would you approximate sqrt(110)? - Describe linear regression, in particular what it is optimizing. - What would be the best fit line for the points (0,4), (2,4) and (2,6)? - There is a group of n people, and you are given a function know(i,j) that outputs True if person i knows person j. Note that this is not necessarily symmetric, i.e. person i may know person j, but person j may not know person i. A celebrity is a person that everyone knows, but who knows no one else. Write a function that outputs a list of all the celebrities.
avatar

Quant Researcher

Interviewed at G-Research

3.8★
Jan 6, 2020

- How would you approximate sqrt(110)? - Describe linear regression, in particular what it is optimizing. - What would be the best fit line for the points (0,4), (2,4) and (2,6)? - There is a group of n people, and you are given a function know(i,j) that outputs True if person i knows person j. Note that this is not necessarily symmetric, i.e. person i may know person j, but person j may not know person i. A celebrity is a person that everyone knows, but who knows no one else. Write a function that outputs a list of all the celebrities.

1. what is the expected times of tossing the coins to get three heads in a row? (smart way is to use Markov process ) 2. sinx + x - 1 = 0, does the solution exist ? if yes, why it has solution and what is it. (I said the solution is close to be pi/2 by observing) 3. sth about ordinary least square, collinearity 4. one simple ODE question, what boundary conditions required to solve Y'' = 0 5. what algorithm used to find the first element greater than target in a sorted array ? The answer is binary search, you don't need to provide code. 6. There is another coding problem which I forgot.
avatar

Quant

Interviewed at Wells Fargo

3.5★
Jan 10, 2019

1. what is the expected times of tossing the coins to get three heads in a row? (smart way is to use Markov process ) 2. sinx + x - 1 = 0, does the solution exist ? if yes, why it has solution and what is it. (I said the solution is close to be pi/2 by observing) 3. sth about ordinary least square, collinearity 4. one simple ODE question, what boundary conditions required to solve Y'' = 0 5. what algorithm used to find the first element greater than target in a sorted array ? The answer is binary search, you don't need to provide code. 6. There is another coding problem which I forgot.

Viewing 2911 - 2920 interview questions

Glassdoor has 2,927 interview questions and reports from Quant interviews. Prepare for your interview. Get hired. Love your job.