Programming & DSA Interview Questions
Programming and data-structures-and-algorithms questions test the implementation skills quant-developer and researcher interviews require, from complexity analysis to clean code.
This area covers arrays and hashing, sorting and searching, recursion, dynamic programming, and Big-O complexity analysis - the implementation toolkit quant-developer and researcher roles require.
Quant DSA interviews often have a numerical or probabilistic flavour - simulating a process, or computing a statistic efficiently - so clean code and correct complexity both matter.
95 programming & dsa questions · all free to practise.
By format:Market MakerHedge Fund QuantNumerical Reasoning TestsTrading Aptitude TestsBetting Game RoundsProp TradingSystematic & Data-Driven TradingOptions TradingETF Trading
- Additions in a naive moving averageEasyProgramming & DSAView →
- Cache misses under LRU evictionEasyProgramming & DSAView →
- Copies made by a growing arrayEasyProgramming & 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 →
- How many rooms for these meetings?EasyProgramming & DSAView →
- Iteration count of a guarded nested loopEasyProgramming & DSAView →
- Longest stretch without a repeated letterEasyProgramming & DSAView →
- Maximum drawdown in one passEasyFinance & DerivativesProgramming & 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 →
- Trade as often as you likeEasyFinance & DerivativesProgramming & DSAView →
- What the majority vote returns when there is no majorityEasyProgramming & DSAView →
- Where counting sort places a valueEasyProgramming & DSAView →
- Where does this Gray codeword sit?EasyProgramming & DSAView →
- Writes in an in-place dedupEasyProgramming & DSAView →
- XOR of a thousand consecutive integersEasyProgramming & DSAView →
- A large power, modular orderMediumProgramming & DSAView →
- Average guesses with binary searchMediumExpected ValueProgramming & DSAView →
- Balanced parenthesesMediumCombinatoricsProgramming & DSAView →
- Biggest rectangle under a skylineMediumProgramming & DSAView →
- Binary search on 1000: the worst caseMediumProgramming & DSAView →
- Call count of memoized FibonacciMediumProgramming & DSAView →
- Cheapest network on four serversMediumExpected ValueProgramming & DSAView →
- Common divisors of the squaresMediumProgramming & DSAView →
- Count set bitsMediumProgramming & DSAView →
- Counting bogosort's comparisonsMediumExpected ValueProgramming & DSAView →
- Counting the innermost callsMediumProgramming & DSAView →
- Cutting a job queue across four machinesMediumProgramming & DSAView →
- Detect a cycle in a linked listMediumProgramming & DSAView →
- Dijkstra meets a negative edgeMediumProgramming & DSAView →
- Distinct substrings of BARBARIANMediumCombinatoricsProgramming & DSAView →
- Euclid's worst-case step countMediumProgramming & DSAView →
- Exact comparisons for min and maxMediumProgramming & DSAView →
- Fewest swaps to sort a permutationMediumCombinatoricsProgramming & DSAView →
- Fewest yes/no questions on averageMediumExpected ValueProgramming & DSAView →
- Finite-difference stabilityMediumFinance & DerivativesProgramming & DSAView →
- From STATISTICS to STOCHASTICMediumProgramming & DSAView →
- How explosive is naive Fibonacci?MediumProgramming & DSAView →
- How many keys move when you add servers?MediumProgramming & DSAView →
- How much a control variate helpsMediumFinance & DerivativesProgramming & DSAView →
- How noisy is an approximate counter?MediumExpected ValueProgramming & DSAView →
- How often the smallest disk movesMediumProgramming & DSAView →
- In-place array rotationMediumProgramming & DSAView →
- Leaves of a degree-3 treeMediumProgramming & DSAView →
- Longest rising run, not necessarily adjacentMediumProgramming & DSAView →
- Multiplications in fast exponentiationMediumProgramming & DSAView →
- Power iterationMediumLinear AlgebraProgramming & DSAView →
- Quickselect average complexityMediumProgramming & DSAView →
- Quicksort's worst case, countedMediumProgramming & DSAView →
- Random contraction finds the bridgeMediumProbabilityProgramming & DSAView →
- Rebuilding a tower of ten ringsMediumBrainteasersProgramming & DSAView →
- Sampling an exponential from a uniformMediumRandom VariablesProgramming & DSAView →
- Sift-up swaps in a binary heapMediumProgramming & DSAView →
- Simulate probability pMediumProbabilityProgramming & DSAView →
- Sorted in one passMediumProbabilityCombinatoricsView →
- Splitting five traders into desksMediumCombinatoricsProgramming & DSAView →
- Subarrays summing to 3, negatives includedMediumProgramming & DSAView →
- The KMP failure table of ABABCABABMediumProgramming & DSAView →
- The costliest mergeMediumProgramming & DSAView →
- The half-full nodeMediumProgramming & DSAView →
- Tuning a Bloom filterMediumProbabilityProgramming & DSAView →
- Valid orders for a small buildMediumCombinatoricsProgramming & DSAView →
- Ways to make a dollarMediumCombinatoricsProgramming & DSAView →
- When the best ratio is not the best packMediumProgramming & DSAView →
- When the naive shuffle is biasedMediumProgramming & DSAView →
- When to prefer memoization over tabulationMediumProgramming & DSAView →
- Worst case of bottom-up heap constructionMediumProgramming & DSAView →
- rand7 from rand5 without wasting the rejectsMediumExpected ValueProgramming & DSAView →
- Absorption in naive floating-point summationHardCalculusProgramming & DSAView →
- Burst the balloons for the most coinsHardProgramming & DSAView →
- Expected comparisons, from first principlesHardProgramming & DSAView →
- How low can a racy counter go?HardProgramming & DSAView →
- Median of a streamHardStatisticsProgramming & DSAView →
- Minimum coins where greedy failsHardProgramming & DSAView →
- Registers for an expression treeHardProgramming & DSAView →
- Reservoir samplingHardStatisticsProgramming & DSAView →
- Six queens, how many ways?HardCombinatoricsProgramming & DSAView →
- Smallest automaton for multiples of sixHardProgramming & DSAView →
- Sorting five items with the fewest comparisonsHardProgramming & DSAView →
- The smallest sorting network on four wiresHardProgramming & DSAView →
- Two Newton iterations for a square rootHardCalculusProgramming & DSAView →
Related guides
Master programming & dsa for quant interviews
Create a free account to check your answers and track progress.
Frequently asked questions
- What programming topics do quant interviews test?
- Core data structures (arrays, hash maps, heaps, trees), sorting and searching, recursion and dynamic programming, and Big-O analysis. Quant-developer roles also probe systems and numerical correctness.
- Which languages are expected for quant programming interviews?
- Most firms accept Python or C++; quant-developer roles often lean on C++ for performance, while research roles frequently use Python. Check the specific role's stack.
- How are quant DSA questions different from standard tech interviews?
- They often blend algorithms with probability or numerics - for example, simulate a random process or compute an expectation efficiently - so both clean implementation and quantitative reasoning are graded.