Programming & DSA Questions for Prop Trading Interviews
A prop 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.
12 questions, all free to practise. The split is 3 easy, 7 medium, 2 hard.
- Additions in a naive moving averageEasyProgramming & DSAView →
- Numbers with exactly two set bitsEasyProgramming & DSAView →
- Recover an XOR of two unknownsEasyProgramming & DSAView →
- Count set bitsMediumProgramming & DSAView →
- Counting the innermost callsMediumProgramming & DSAView →
- Euclid's worst-case step countMediumProgramming & DSAView →
- Exact comparisons for min and maxMediumProgramming & DSAView →
- Sift-up swaps in a binary heapMediumProgramming & DSAView →
- The costliest mergeMediumProgramming & DSAView →
- The half-full nodeMediumProgramming & DSAView →
- Absorption in naive floating-point summationHardCalculusProgramming & DSAView →
- Expected comparisons, from first principlesHardProgramming & 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.