Hard Quant Developer Interview Questions
Everything asked of quant developers, filtered to the hard end - useful for calibrating where you actually are.
53 questions, all free to practise. The topics that come up most are combinatorics (29), brainteasers (27), probability (11), calculus (6).
- A Fibonacci power sumHardBrainteasersView →
- A flea's shortest escape across a boxHardBrainteasersCalculusView →
- A function minus its derivativeHardCalculusView →
- A geometric series that sums to a squareHardBrainteasersView →
- A rectangle over the shaded rowHardProbabilityCombinatoricsView →
- A weighted sum of binomialsHardCombinatoricsBrainteasersView →
- Absorption in naive floating-point summationHardCalculusProgramming & DSAView →
- Average of near-diagonal numbersHardCombinatoricsBrainteasersView →
- Balls into bowls, three eachHardCombinatoricsView →
- Cats and miceHardBrainteasersView →
- Cubes over the terminating denominatorsHardBrainteasersCalculusView →
- Dealing until kings or a king-and-aceHardCombinatoricsExpected ValueView →
- Digits with distinct pairwise sumsHardCombinatoricsBrainteasersView →
- Domino tilings of a 3×8 gridHardCombinatoricsView →
- Doors toggled by primesHardCombinatoricsBrainteasersView →
- Everyone gets one of eachHardProbabilityCombinatoricsView →
- Expected comparisons, from first principlesHardProgramming & DSAView →
- Laplace transform of a Brownian exit timeHardStochastic ProcessesView →
- Largest pairwise-coprime subset sumHardCombinatoricsBrainteasersView →
- Last one standingHardCombinatoricsBrainteasersView →
- Locks for a four-of-seven safeHardCombinatoricsBrainteasersView →
- Making a power of Brownian motion a martingaleHardStochastic ProcessesView →
- Mean of a mean-reverting processHardStochastic ProcessesFinance & DerivativesView →
- Measuring two pintsHardBrainteasersView →
- Median of a streamHardStatisticsProgramming & DSAView →
- Minimum coins where greedy failsHardProgramming & DSAView →
- No two samples too closeHardProbabilityCombinatoricsView →
- Odd sums on a 3×3 gridHardProbabilityCombinatoricsView →
- Only seven left unchosenHardProbabilityCombinatoricsView →
- Pairing gloves within oneHardProbabilityCombinatoricsView →
- Pairing with a difference of 1 or 11HardCombinatoricsBrainteasersView →
- Prisoners and the boxesHardProbabilityBrainteasersView →
- Reservoir samplingHardStatisticsProgramming & DSAView →
- Rotations divisible by 37HardCombinatoricsBrainteasersView →
- Second moment of a Gaussian-kernel stochastic integralHardCalculusStochastic ProcessesView →
- Seven seated in age orderHardProbabilityCombinatoricsView →
- Shuffles to restore the deckHardCombinatoricsBrainteasersView →
- Smallest number with digit product 10000HardCombinatoricsBrainteasersView →
- Subsets with one consecutive pairHardCombinatoricsView →
- Sum of repeating decimalsHardCombinatoricsBrainteasersView →
- Sums of fours and fivesHardCombinatoricsBrainteasersView →
- Ten prime digits with a set productHardCombinatoricsView →
- The leap-frog's favorite landing spotHardProbabilityStochastic ProcessesView →
- The number with no new digitsHardBrainteasersView →
- The survivor in the circleHardBrainteasersView →
- Three eggs, nine dropsHardCombinatoricsBrainteasersView →
- Triangle with equal side sumsHardCombinatoricsBrainteasersView →
- Twelve balls, one oddHardBrainteasersView →
- Two Newton iterations for a square rootHardCalculusProgramming & DSAView →
- Two eggs, 100 floorsHardBrainteasersView →
- Two elements in the long cycleHardProbabilityCombinatoricsView →
- When a power of the process is a submartingaleHardProbabilityStochastic ProcessesView →
- When k-to-the-k is a squareHardCombinatoricsBrainteasersView →
Widen the search
This set is a slice of a larger one. 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.