Set 06 - Linked Lists
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 142. Linked List Cycle II | Medium | Floyd's Algorithm | Video |
| LC 143. Reorder List | Medium | Multiple Techniques | Video |
| LC 19. Remove Nth Node From End | 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 142: after meeting, move one pointer to head; meet at entry.
- LC 143: find middle, reverse second half, then merge alternately.
- LC 19: two pointers with gap n+1 to remove target.
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...