Programming & DSA Questions for Trading Aptitude Tests Interviews
A trading aptitude tests 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.
16 questions, all free to practise. The split is 11 easy, 5 medium.
- Depth of a key in a BSTEasyProgramming & DSAView →
- Grouping anagramsEasyProgramming & DSAView →
- Iteration count of a guarded nested loopEasyProgramming & DSAView →
- Median across two sorted arraysEasyProgramming & DSAView →
- Multiply by a constant with shiftsEasyProgramming & DSAView →
- Nodes fixed by a group reversalEasyProgramming & DSAView →
- Numbers with exactly two set bitsEasyProgramming & DSAView →
- Peak depth times group count of a bracket scanEasyProgramming & DSAView →
- Smallest array forcing 7 probesEasyProgramming & DSAView →
- The distance-2 layer of a graphEasyProgramming & DSAView →
- Writes in an in-place dedupEasyProgramming & DSAView →
- Common divisors of the squaresMediumProgramming & DSAView →
- How many stack outputs?MediumProgramming & DSAView →
- How often the smallest disk movesMediumProgramming & DSAView →
- Leaves of a degree-3 treeMediumProgramming & DSAView →
- The costliest mergeMediumProgramming & 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.