A majority of questions boil down to these 10 concepts. If you’re not good at all of them, you’re probably not ready for interviews.
- Depth-first Search
- Breadth-first search
- Using Hash Table for quick lookups
- Memoization (with Recursion)
- Backtracking (with Recursion)
- Binary Search
- Traversing a Binary Tree
- Searching a Binary Search Tree
- Using a Heap or Priority Queue to keep track of max/min elements
All the best!