Programming & DSA Questions for Hedge Fund Quant Interviews
A hedge fund quant 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.
20 questions, all free to practise. The split is 6 easy, 12 medium, 2 hard.
- Additions in a naive moving averageEasyProgramming & DSAView →
- Cache misses under LRU evictionEasyProgramming & DSAView →
- Expected cost of a mixed lookup workloadEasyProgramming & DSAView →
- Maximum subarray sumEasyProgramming & DSAView →
- Nodes fixed by a group reversalEasyProgramming & DSAView →
- Where counting sort places a valueEasyProgramming & DSAView →
- Binary search on 1000: the worst caseMediumProgramming & DSAView →
- Detect a cycle in a linked listMediumProgramming & DSAView →
- Exact comparisons for min and maxMediumProgramming & DSAView →
- Finite-difference stabilityMediumFinance & DerivativesProgramming & DSAView →
- How explosive is naive Fibonacci?MediumProgramming & DSAView →
- How much a control variate helpsMediumFinance & DerivativesProgramming & DSAView →
- In-place array rotationMediumProgramming & DSAView →
- Power iterationMediumLinear AlgebraProgramming & DSAView →
- Quickselect average complexityMediumProgramming & DSAView →
- Quicksort's worst case, countedMediumProgramming & DSAView →
- Sift-up swaps in a binary heapMediumProgramming & DSAView →
- The half-full nodeMediumProgramming & DSAView →
- Median of a streamHardStatisticsProgramming & DSAView →
- Minimum coins where greedy failsHardProgramming & 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.