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
- Problem Solving Patterns - reusable problem-solving patterns.
- Solved Problems - solved problem index.
Recent Notes
- Subarray Sum Equals K
- Two Sum
- Valid Parentheses
- Remove All Adjacent Duplicates In String
- Remove All Adjacent Duplicates In String II
- Daily Temperatures
- Merge Intervals
- Same Tree
- Binary Tree Paths
- Jump Game
- 3Sum
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock II
- Find Pivot Index
- Rank Transform Of An Array