Set 28 - Binary Search Mastery
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 704. Binary Search | Easy | Standard | Video |
| LC 74. Search a 2D Matrix | Medium | 2D → 1D | Video |
| LC 875. Koko Eating Bananas | Medium | Search on Answer | Video |
| LC 153. Find Minimum in Rotated Sorted Array | Medium | Modified BS | Video |
| LC 33. Search in Rotated Sorted Array | Medium | Modified BS | Video |
| LC 4. Median of Two Sorted Arrays | Hard | Binary Search | Video |
| LC 20. Valid Parentheses | Easy | Stack & Monotonic Stack | Video |
| LC #155 Min Stack | |||
| LC #150 Evaluate Reverse Polish Notation | |||
| LC 739. Daily Temperatures | Medium | Stack & Monotonic Stack | Video |
| LC #853 Car Fleet | |||
| LC 84. Largest Rectangle in Histogram | Hard | Stack & Monotonic Stack | Video |
| LC 57. Insert Interval | Medium | Intervals | Video |
| LC 56. Merge Intervals | Medium | Intervals | Video |
| LC #435 Non-overlapping Intervals | |||
| LC #252 Meeting Rooms | |||
| LC 253. Meeting Rooms II | Medium | Intervals | Video |
| LC 78. Subsets | Medium | Backtracking | Video |
| LC #90 Subsets II | |||
| LC 46. Permutations | Medium | Backtracking | Video |
| LC 39. Combination Sum | Medium | Backtracking | Video |
| LC #40 Combination Sum II | |||
| LC 79. Word Search | Medium | Backtracking | Video |
| LC #131 Palindrome Partitioning | |||
| LC #51 N-Queens |
Deliverables
- Write a 1-line invariant for each problem.
- Note 1 edge case or pitfall per problem.
- Record time-to-first-correct solution.
Notes
- LC 704: standard binary search on sorted array.
- LC 74: treat matrix as 1D; binary search.
- LC 875: binary search on answer with canFinish.
- LC 153: compare mid to right to find min.
- LC 33: rotated binary search; pick sorted half.
- LC 4: partition arrays; ensure left <= right.
- LC 20: stack for matching brackets.
- LC 155: stack + min stack (or store pairs).
- LC 150: stack eval; pop two for operator.
- LC 739: monotonic stack of indices.
- LC 853: sort by position; stack of times.
- LC 84: monotonic stack with sentinel.
- LC 57: insert then merge intervals.
- LC 56: sort by start; merge overlaps.
- LC 435: sort by end; greedy keep non-overlap.
- LC 252: sort intervals; check overlaps.
- LC 253: min-heap of end times.
- LC 78: backtrack include/exclude; collect subsets.
- LC 90: backtrack + skip duplicates after sort.
- LC 46: backtrack permutations with used[]/swap.
- LC 39: backtrack; reuse same index.
- LC 40: backtrack; skip duplicates, no reuse.
- LC 79: DFS grid with visited backtrack.
- LC 131: backtrack partitions; palindrome check.
- LC 51: backtrack row by row; track cols/diags.
Review
- Time spent + where you got stuck?
- Biggest mistake or missed edge case?
- One concrete improvement for next time.
Comments
Share your approach or ask questions
?
|
Markdown supported
Sign in to post
Loading comments...