Grokking Rust

Section 1: Minimum Chapters to go through!

Chapter	Completed	Date Completed
Warmup	[✓]	31/7/24
Sliding Window	[✓]	5/8/24
Two Pointer	[ ]
Monotonic Stack	[ ]
Matrix Traversal	[ ]
Breadth-First-Search	[ ]
Depth First Search	[ ]

Section 2: Solid Chapters to Learn

Chapter	Completed	Date Completed
Fast and Slow pointer	[ ]
Merge Interval	[ ]
In-Place Reversal of LinkedList	[ ]
Top K Elements	[ ]
Subsets	[ ]
Topological Sort	[ ]
Modified Binary Search	[ ]

Section 3: Nice to Haves

Chapter	Completed	Date Completed
Tries	[ ]
- Implement a prefix tree (NeetCode)	[ ]
- Implement a Trie (NeetCode)	[ ]
Two Heaps	[ ]
Cyclic Sort	[ ]
K Way Merge	[ ]

Section 4: Low ROI

Chapter	Completed	Date Completed
Dynamic Programming	[ ]

Notes: