Quantitative Associate Interview Questions

10,154 quantitative associate interview questions shared by candidates

You’re given two red cards and two black cards. The cards are shuffled and placed face down. You flip them over one at a time. You start with $100, and before revealing each card, you can choose how much to bet. If the card is red, you win double your bet. If it’s black, you lose the amount you bet. What’s the optimal betting strategy in this scenario? Now, suppose there’s a $20 entry fee to play the game. How does that affect your strategy?
avatar

Quantitative Researcher

Interviewed at Da Vinci Derivatives

4.5
May 1, 2025

You’re given two red cards and two black cards. The cards are shuffled and placed face down. You flip them over one at a time. You start with $100, and before revealing each card, you can choose how much to bet. If the card is red, you win double your bet. If it’s black, you lose the amount you bet. What’s the optimal betting strategy in this scenario? Now, suppose there’s a $20 entry fee to play the game. How does that affect your strategy?

Coding: Array length n. Integer k. Find the minimum sub-array length (no elements can be skipped) for which the sub-array has at least k distinct elements. If no such sub-array exists return -1. Implement naively. What is the complexity. Implement efficiently
avatar

Quantitative Reseracher

Interviewed at Squarepoint Capital

3.9
Oct 24, 2023

Coding: Array length n. Integer k. Find the minimum sub-array length (no elements can be skipped) for which the sub-array has at least k distinct elements. If no such sub-array exists return -1. Implement naively. What is the complexity. Implement efficiently

1) dynamic programming: cansum(int a, list [b,c,d]), return whether a can be a sum of elements in the list; 2) option pricing: explain ito's lemma 3) two players, one bid a k from U(0,1), expectation of draws to bid the opponent
avatar

Quantitative Researcher

Interviewed at Squarepoint Capital

3.9
Oct 21, 2023

1) dynamic programming: cansum(int a, list [b,c,d]), return whether a can be a sum of elements in the list; 2) option pricing: explain ito's lemma 3) two players, one bid a k from U(0,1), expectation of draws to bid the opponent

Viewing 9691 - 9700 interview questions

Glassdoor has 10,154 interview questions and reports from Quantitative associate interviews. Prepare for your interview. Get hired. Love your job.