Practice Lab
DS And Algorithms
Goals
- Build reliable problem-solving patterns.
- Practice Java implementations.
- Track mistakes and revisit weak areas.
Core Tracks
| Track | Topics |
|---|---|
| Foundations | Big-O, arrays, strings, hashing, sorting |
| Linear structures | stacks, queues, linked lists, monotonic structures |
| Trees and graphs | binary trees, BSTs, BFS, DFS, shortest paths |
| Recursion and DP | backtracking, memoization, tabulation |
| Advanced patterns | intervals, heaps, union-find, tries, sliding window |
Files
patterns.md- reusable problem-solving patterns.problems.md- solved problem index.