Programming & DSA Questions for Market Maker Interviews
A market maker round does not test programming & dsa the way a textbook does. This set is the overlap - the programming & dsa questions that actually turn up in this format.
19 questions, all free to practise. The split is 6 easy, 10 medium, 3 hard.
- Counting complement pairsEasyProgramming & DSAView →
- Depth of a key in a BSTEasyProgramming & DSAView →
- Guessing a number with high-low hintsEasyBrainteasersProgramming & DSAView →
- Maximum subarray sumEasyProgramming & DSAView →
- Peak depth times group count of a bracket scanEasyProgramming & DSAView →
- The two missing numbersEasyProgramming & DSAView →
- Balanced parenthesesMediumCombinatoricsProgramming & DSAView →
- Call count of memoized FibonacciMediumProgramming & DSAView →
- Climbing stairsMediumCombinatoricsProgramming & DSAView →
- Count set bitsMediumProgramming & DSAView →
- Multiplications in fast exponentiationMediumProgramming & DSAView →
- Rebuilding a tower of ten ringsMediumBrainteasersProgramming & DSAView →
- Sampling an exponential from a uniformMediumRandom VariablesProgramming & DSAView →
- Simulate probability pMediumProbabilityProgramming & DSAView →
- When the naive shuffle is biasedMediumProgramming & DSAView →
- When to prefer memoization over tabulationMediumProgramming & DSAView →
- Expected comparisons, from first principlesHardProgramming & DSAView →
- Reservoir samplingHardStatisticsProgramming & DSAView →
- Two Newton iterations for a square rootHardCalculusProgramming & DSAView →
Widen the search
This set is a slice of two larger ones. If it is too narrow, start here instead:
Practise these free
Create a free account to check your answers, track what you have solved, and run the timed simulators.