Interview Sprint roadmap
Two weeks of the most-asked mediums, with a hard to finish most topics.
For: Interviewing soon, some DSA background
Arrays and Hashing
Trade memory for speed by remembering what you have already seen.
Two Pointers
Walk a sequence from both ends, or at two speeds, to avoid nested loops.
Binary Search
Halve the search space each step, on sorted data or on an answer range.
Stack
Last in, first out. Use it to match pairs and undo work.
Sliding Window
Keep a moving range valid while you slide it across the input.
Intervals
Sort ranges by start so overlaps can be merged, counted and scheduled.
Linked List
Rewire pointers in place, and use fast and slow pointers to find cycles and middles.
Trees
Think recursively: solve a node from the answers for its children.
- Binary Tree Level Order Traversal
- Lowest Common Ancestor of a Binary Tree
- Validate Binary Search Tree
- Binary Tree Maximum Path Sum
- Serialize and Deserialize Binary Tree
Heap / Priority Queue
Always get the smallest or largest item next without sorting everything.
Graphs
Traverse connected structures: islands, components, shortest hops in a grid.
Backtracking
Build candidates step by step and undo a choice when it cannot lead to an answer.
Design
Combine data structures to build a cache, a stack with extras or an iterator.
Topological Sort
Order tasks by their dependencies and detect cycles.
1-D Dynamic Programming
Break a problem into overlapping subproblems and store each answer once.
Greedy
Take the locally best choice when it provably leads to a global best.
2-D Dynamic Programming
Fill a table indexed by two variables: grids, two strings, intervals.