Programming & DSA Interview Questions for Quant Developers
Quant Developers get asked programming & dsa differently from other quant roles - the emphasis shifts with what the job actually does. This is that slice.
56 questions, 31 of them free to practise right now. The split is 22 easy, 28 medium, 6 hard.
- Additions in a naive moving averageEasyProgramming & DSAView →
- Cache misses under LRU evictionEasyProgramming & DSAView →
- Counting complement pairsEasyProgramming & DSAView →
- Depth of a key in a BSTEasyProgramming & DSAView →
- Expected cost of a mixed lookup workloadEasyProgramming & DSAView →
- Grouping anagramsEasyProgramming & DSAView →
- Guessing a number with high-low hintsEasyBrainteasersProgramming & DSAView →
- Iteration count of a guarded nested loopEasyProgramming & DSAView →
- Maximum subarray sumEasyProgramming & DSAView →
- Median across two sorted arraysEasyProgramming & DSAView →
- Multiplications saved by Horner's methodEasyProgramming & DSAView →
- Multiply by a constant with shiftsEasyProgramming & DSAView →
- Nodes fixed by a group reversalEasyProgramming & DSAView →
- Numbers with exactly two set bitsEasyProgramming & DSAView →
- Peak depth times group count of a bracket scanEasyProgramming & DSAView →
- Probes in a colliding hash tableEasyProgramming & DSAView →
- Recover an XOR of two unknownsEasyProgramming & DSAView →
- Smallest array forcing 7 probesEasyProgramming & DSAView →
- The distance-2 layer of a graphEasyProgramming & DSAView →
- The two missing numbersEasyProgramming & DSAView →
- Where counting sort places a valueEasyProgramming & DSAView →
- Writes in an in-place dedupEasyProgramming & DSAView →
- A large power, modular orderMediumProgramming & DSAView →
- Balanced parenthesesMediumCombinatoricsProgramming & DSAView →
- Exact comparisons for min and maxMediumProgramming & DSAView →
- Multiplications in fast exponentiationMediumProgramming & DSAView →
- Quicksort's worst case, countedMediumProgramming & 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 →
- Call count of memoized FibonacciMediumProgramming & DSA Premium
- Climbing stairsMediumCombinatoricsProgramming & DSA Premium
- Common divisors of the squaresMediumProgramming & DSA Premium
- Count set bitsMediumProgramming & DSA Premium
- Counting the innermost callsMediumProgramming & DSA Premium
- Detect a cycle in a linked listMediumProgramming & DSA Premium
- Euclid's worst-case step countMediumProgramming & DSA Premium
- How explosive is naive Fibonacci?MediumProgramming & DSA Premium
- How many stack outputs?MediumProgramming & DSA Premium
- How often the smallest disk movesMediumProgramming & DSA Premium
- In-place array rotationMediumProgramming & DSA Premium
- Leaves of a degree-3 treeMediumProgramming & DSA Premium
- Power iterationMediumLinear AlgebraProgramming & DSA Premium
- Quickselect average complexityMediumProgramming & DSA Premium
- Sift-up swaps in a binary heapMediumProgramming & DSA Premium
- The costliest mergeMediumProgramming & DSA Premium
- The half-full nodeMediumProgramming & DSA Premium
- Two eggs, one hundred floorsMediumProgramming & DSA Premium
- When to prefer memoization over tabulationMediumProgramming & DSA Premium
- Absorption in naive floating-point summationHardCalculusProgramming & DSA Premium
- Expected comparisons, from first principlesHardProgramming & DSA Premium
- Median of a streamHardStatisticsProgramming & DSA Premium
- Minimum coins where greedy failsHardProgramming & DSA Premium
- Reservoir samplingHardStatisticsProgramming & DSA Premium
- Two Newton iterations for a square rootHardCalculusProgramming & DSA Premium
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. Premium unlocks a full worked solution for every question.