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, 9 of them free to practise right now. 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 →
- Exact comparisons for min and maxMediumProgramming & DSAView →
- How much a control variate helpsMediumFinance & DerivativesProgramming & DSAView →
- Quicksort's worst case, countedMediumProgramming & DSAView →
- Detect a cycle in a linked listMediumProgramming & DSA Premium
- Finite-difference stabilityMediumFinance & DerivativesProgramming & DSA Premium
- How explosive is naive Fibonacci?MediumProgramming & DSA Premium
- In-place array rotationMediumProgramming & DSA Premium
- Power iterationMediumLinear AlgebraProgramming & DSA Premium
- Quickselect average complexityMediumProgramming & DSA Premium
- Sift-up swaps in a binary heapMediumProgramming & DSA Premium
- The half-full nodeMediumProgramming & DSA Premium
- Two eggs, one hundred floorsMediumProgramming & DSA Premium
- Median of a streamHardStatisticsProgramming & DSA Premium
- Minimum coins where greedy failsHardProgramming & 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.