Linked lists
Rewire pointers safely: reversal, fast/slow runners, dummy heads, and list-backed data structures.
Solved
0/10
1Reverse Linked Listpointer manipulationEasy2Merge Two Sorted Listsdummy head · mergeEasy3Linked List Cyclefast and slow pointersEasy4Remove Nth Node From End of Listtwo pointers · dummy headMedium5Reorder Listfast and slow pointers · reversalMedium6Add Two Numbersdummy head · simulationMedium7Copy List with Random Pointerhash map · deep copyMedium8LRU Cachedesign · doubly linked list · hash mapMedium9Merge k Sorted Listsdivide and conquer · mergeHard10Reverse Nodes in k-Groupreversal · dummy headHard