Hard Programming & DSA Interview Questions
These are the programming & dsa questions that separate candidates who know the technique from those who can apply it under pressure.
13 questions, all free to practise.
- Absorption in naive floating-point summationHardCalculusProgramming & DSAView →
- Burst the balloons for the most coinsHardProgramming & DSAView →
- Expected comparisons, from first principlesHardProgramming & DSAView →
- How low can a racy counter go?HardProgramming & DSAView →
- Median of a streamHardStatisticsProgramming & DSAView →
- Minimum coins where greedy failsHardProgramming & DSAView →
- Registers for an expression treeHardProgramming & DSAView →
- Reservoir samplingHardStatisticsProgramming & DSAView →
- Six queens, how many ways?HardCombinatoricsProgramming & DSAView →
- Smallest automaton for multiples of sixHardProgramming & DSAView →
- Sorting five items with the fewest comparisonsHardProgramming & DSAView →
- The smallest sorting network on four wiresHardProgramming & DSAView →
- Two Newton iterations for a square rootHardCalculusProgramming & DSAView →
Widen the search
This set is a slice of a larger one. 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.