Easy Programming & DSA Interview Questions
Working a topic at its easiest level first is how you find out whether the gap is the concept or the speed. These are the programming & dsa questions to start on.
22 questions, all free to practise.
- Additions in a naive moving averageEasyProgramming & DSAView →
- Cache misses under LRU evictionEasyProgramming & DSAView →
- Counting complement pairsEasyProgramming & DSAView →
- Depth of a key in a BSTEasyProgramming & DSAView →
- Expected cost of a mixed lookup workloadEasyProgramming & DSAView →
- Grouping anagramsEasyProgramming & DSAView →
- Guessing a number with high-low hintsEasyBrainteasersProgramming & DSAView →
- Iteration count of a guarded nested loopEasyProgramming & DSAView →
- Maximum subarray sumEasyProgramming & DSAView →
- Median across two sorted arraysEasyProgramming & DSAView →
- Multiplications saved by Horner's methodEasyProgramming & 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 →
- Probes in a colliding hash tableEasyProgramming & DSAView →
- Recover an XOR of two unknownsEasyProgramming & DSAView →
- Smallest array forcing 7 probesEasyProgramming & DSAView →
- The distance-2 layer of a graphEasyProgramming & DSAView →
- The two missing numbersEasyProgramming & DSAView →
- Where counting sort places a valueEasyProgramming & DSAView →
- Writes in an in-place dedupEasyProgramming & 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.