This file outlines my learning journey step by step.
- Variables, loops, conditionals, functions
- Data types (strings, lists, sets, dicts)
- Input/Output practice
- Basic math (mod, gcd/lcm)
- Brute force vs optimized
- Two pointers
- Sliding window
- Prefix sums
- Hash maps & sets
- Sorting & searching
- Recursion & backtracking
- Stacks, queues, linked lists
- Trees and traversals
- Primes & sieve
- Modular arithmetic
- Combinatorics
- Bitwise tricks
- 1D DP (Fibonacci, coin change)
- 2D DP (LCS, knapsack)
- Optimization techniques
- BFS, DFS
- Shortest paths (Dijkstra, Bellman-Ford)
- MST (Kruskal, Prim)
- Topological sort
- String algorithms (KMP, Rabin-Karp)
- Segment trees, Fenwick trees
- Union-Find
- Geometry basics
- Advanced DP
✅ As I progress, I will check off completed stages here.