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, 4 of them free to practise right now. 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 →
- Exact comparisons for min and maxMediumProgramming & DSAView →
- Count set bitsMediumProgramming & DSA Premium
- Counting the innermost callsMediumProgramming & DSA Premium
- Euclid's worst-case step countMediumProgramming & DSA Premium
- Sift-up swaps in a binary heapMediumProgramming & DSA Premium
- The costliest mergeMediumProgramming & DSA Premium
- The half-full nodeMediumProgramming & DSA Premium
- Absorption in naive floating-point summationHardCalculusProgramming & DSA Premium
- Expected comparisons, from first principlesHardProgramming & 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.