Algorithms Roadmap
How to approach common algorithmic patterns — sorting, searching, graph traversal, dynamic programming, and greedy strategies.
Learning Order
- Sorting Algorithms — comparison sorts, stability, O(n log n) barrier
- Binary Search — halving the search space, O(log n)
- Two Pointers — sorted array patterns
- Sliding Window — subarray/substring problems
- BFS and DFS — graph and tree traversal
- Dynamic Programming — optimal substructure and overlapping subproblems
- Greedy Algorithms — local optimality → global optimality
- Backtracking — systematic search with pruning
Connections
- Prereqs: Data Structures Roadmap
- Used by: Systems Programming Roadmap, Embedded Systems Roadmap