Set 02 - Arrays & Two Pointers
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 152. Maximum Product Subarray | Medium | DP/Kadane's | 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 11. Container With Most Water | Medium | Two Pointers | Video |
| LC 15. 3Sum | Medium | Two Pointers | Video |
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 152: track max_prod and min_prod because negatives flip sign.
- LC 153: binary search; minimum lies in unsorted half (compare mid to right).
- LC 33: binary search rotated; find sorted half, then check target range.
- LC 11: two pointers; move the shorter bar to possibly increase area.
- LC 15: sort + two-sum with l/r; skip duplicates carefully.
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...