Opening page…
Rewire pointers safely: reversal, fast/slow runners, dummy heads, and list-backed data structures.
Solved
| Solved | # | Problem | Pattern | Level | Preview |
|---|---|---|---|---|---|
| 1 | Reverse Linked List | pointer manipulation | Easy | ||
| 2 | Merge Two Sorted Lists | dummy head · merge | Easy | ||
| 3 | Linked List Cycle | fast and slow pointers | Easy | ||
| 4 | Remove Nth Node From End of List | two pointers · dummy head | Medium | ||
| 5 | Reorder List | fast and slow pointers · reversal | Medium | ||
| 6 | Add Two Numbers | dummy head · simulation | Medium | ||
| 7 | Copy List with Random Pointer | hash map · deep copy | Medium | ||
| 8 | LRU Cache | design · doubly linked list · hash map | Medium | ||
| 9 | Merge k Sorted Lists | divide and conquer · merge | Hard | ||
| 10 | Reverse Nodes in k-Group | reversal · dummy head | Hard |
Showing 1–10 of 10 problems