Linked lists
Nodes that point to the next one: walking, reversing and relinking them without losing the rest.
| Status | Challenge | Topics | Level | Accepted | Save |
|---|---|---|---|---|---|
| 1.Reverse a Linked ListTurn a linked list around so its last node comes first. | Linked lists | Easy | – | ||
| 2.Merge Two Sorted ListsJoin two sorted linked lists into one sorted list. | Linked listsTwo pointers | Easy | – | ||
| 3.Middle of a Linked ListFind the middle node of a linked list in one pass. | Linked listsTwo pointers | Easy | – | ||
| 4.Remove the Nth Node From the EndUnlink the node n places from the end of a linked list. | Linked listsTwo pointers | Medium | – | ||
| 5.Add Two Numbers in ListsAdd two numbers stored digit by digit in linked lists. | Linked listsMath | Medium | – | ||
| 6.Reverse in Groups of kReverse a linked list k nodes at a time, leaving a short last group as it is. | Linked lists | Hard | – |