Set 05 - Linked Lists
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 206. Reverse Linked List | Easy | Iterative/Recursive | Video |
| LC 21. Merge Two Sorted Lists | Easy | Two Pointers | Video |
| LC 141. Linked List Cycle | Easy | Fast/Slow Pointer | 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 206: reverse with prev/curr pointers (or recursion).
- LC 21: merge with dummy head; advance the smaller node.
- LC 141: fast/slow pointer cycle detection.
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...