{
adam
coding
}
~/home
~/about
~/projects
~/blog
~/tracker
~/uses
~/contact
☀️
~/home
~/about
~/projects
~/blog
~/tracker
~/uses
~/contact
☀️
DSA Tracker
0%
Apr 07 →
Jul 20, 2026
on track
Week 18: Backtracking & Final Review
| Phase 7: Fast Track — Advanced Patterns
Day 1-3: Backtracking
3-4 hours
📚 Learning
Brute-force: iterative bit-mask enumerate all 2^n subsets
Backtracking: recursive include/exclude pattern O(2^n)
Brute-force: generate all n! permutations iteratively
Backtracking: swap-based or used-array approach O(n·n!)
Backtracking with pruning: skip if remainder < candidate
Brute-force: try every cell as start, recurse O(m·n·4^L)
Optimised: backtrack with visited set, early termination
🔗 LeetCode
78. Subsets
Medium
46. Permutations
Medium
39. Combination Sum
Medium
79. Word Search
Medium
📝 Reflection / Notes:
Day 4-5: Sorting & Greedy (Bonus)
2-3 hours
📚 Learning
Brute-force: check all interval pairs O(n²)
Optimal: sort by start + merge O(n log n)
Brute-force: try all insertion positions O(n²)
Optimal: binary search insert position + merge O(n)
Greedy: sort by end time, count non-overlapping O(n log n)
🔗 LeetCode
56. Merge Intervals
Medium
57. Insert Interval
Medium
435. Non-overlapping Intervals
Medium
📝 Reflection / Notes:
Day 6-7: Fast Track Final Review
3-4 hours
📚 Learning
Timed: solve 3 random Easy in 30 mins total
Timed: solve 3 random Medium in 75 mins total
For each: state brute-force approach + complexity first
For each: then state optimal approach + complexity
Practice: explain your approach out loud as you code
🔄 Review
Two Sum
Coin Change
Number of Islands
Subsets
Merge Intervals
📝 Reflection / Notes: