Skip to contentSkip to footer

Quantitative Research Analyst Interview Questions

Salaries
Interviews

3,500 quantitative research analyst interview questions shared by candidates

There are a collection of particles. You are given a string of 'L' and 'R's, where 'L' denote a left moving particle and 'R' denote a right moving particle. The moving speed is given as another parameter. Multiple particles could stay on the same position. Give the animation of the moving particles.
avatar

Quantitative Research

Interviewed at Two Sigma

3.9★
Oct 25, 2010

There are a collection of particles. You are given a string of 'L' and 'R's, where 'L' denote a left moving particle and 'R' denote a right moving particle. The moving speed is given as another parameter. Multiple particles could stay on the same position. Give the animation of the moving particles.

Let X and Y be random variables with standard deviation a and b. What are the bounds of Var(X + Y)? Pile of 100 coins, 99 fair 1 double heads. Pick random coin, flip 10 times, get 10 heads. What is the probability the coin is double headed coin? Dice sum games.
avatar

Quantitative Research Intern

Interviewed at AKUNA CAPITAL

4★
Oct 7, 2019

Let X and Y be random variables with standard deviation a and b. What are the bounds of Var(X + Y)? Pile of 100 coins, 99 fair 1 double heads. Pick random coin, flip 10 times, get 10 heads. What is the probability the coin is double headed coin? Dice sum games.

You are given an array of integers, A1, A2, ..., An, including negatives and positives, and another integer S. Now we need to find three different integers in the array, whose sum is closest to the given integer S. If there exists more than one solution, any of them is ok. Is there an algorithm to find the three integers in O(n^2) time?
avatar

Quantitative Research Analyst

Interviewed at Citadel

4★
Jun 13, 2011

You are given an array of integers, A1, A2, ..., An, including negatives and positives, and another integer S. Now we need to find three different integers in the array, whose sum is closest to the given integer S. If there exists more than one solution, any of them is ok. Is there an algorithm to find the three integers in O(n^2) time?

Viewing 81 - 90 interview questions

Glassdoor has 3,500 interview questions and reports from Quantitative research analyst interviews. Prepare for your interview. Get hired. Love your job.