Programming & DSA Questions for Systematic & Data-Driven Trading Interviews
A systematic & data-driven trading 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.
25 questions, all free to practise. The split is 6 easy, 14 medium, 5 hard.
- Counting complement pairsEasyProgramming & DSAView →
- Expected cost of a mixed lookup workloadEasyProgramming & DSAView →
- Maximum subarray sumEasyProgramming & DSAView →
- Multiplications saved by Horner's methodEasyProgramming & DSAView →
- Recover an XOR of two unknownsEasyProgramming & DSAView →
- Where counting sort places a valueEasyProgramming & DSAView →
- Balanced parenthesesMediumCombinatoricsProgramming & DSAView →
- Binary search on 1000: the worst caseMediumProgramming & DSAView →
- Euclid's worst-case step countMediumProgramming & DSAView →
- Finite-difference stabilityMediumFinance & DerivativesProgramming & DSAView →
- How explosive is naive Fibonacci?MediumProgramming & DSAView →
- How much a control variate helpsMediumFinance & DerivativesProgramming & DSAView →
- How often the smallest disk movesMediumProgramming & DSAView →
- Multiplications in fast exponentiationMediumProgramming & DSAView →
- Power iterationMediumLinear AlgebraProgramming & DSAView →
- Quickselect average complexityMediumProgramming & DSAView →
- Quicksort's worst case, countedMediumProgramming & DSAView →
- Rebuilding a tower of ten ringsMediumBrainteasersProgramming & DSAView →
- Sampling an exponential from a uniformMediumRandom VariablesProgramming & DSAView →
- When the naive shuffle is biasedMediumProgramming & DSAView →
- Absorption in naive floating-point summationHardCalculusProgramming & DSAView →
- Median of a streamHardStatisticsProgramming & DSAView →
- Minimum coins where greedy failsHardProgramming & DSAView →
- Reservoir samplingHardStatisticsProgramming & DSAView →
- Two Newton iterations for a square rootHardCalculusProgramming & 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.