Common interview topics by priority
Must know
- Arrays, strings, hash maps
- Linked list, stack, queue
- Trees, BST, graphs
- Recursion, backtracking
- DP basics
- BFS/DFS
- Binary search
- Heaps
Should know
- Trie
- Union-Find
- Segment tree
- Greedy proofs
- Bit manipulation
Good to know
- Advanced graphs
- Topological sort variants
- interval scheduling
- randomized algorithms
Can you explain it without the notes?
Common interview topics by priority
Use your own words. Explain an example and one limitation before checking the explanation.
Check your explanation
Must know
Turn this concept into a clear answer.
Practice this conceptAdapted from 14_DSA_MASTER.md · “17. Common interview topics by priority”. Examples are study fragments; framework behavior can depend on your version.