| 2. Add Two Numbers | Go | Medium | O(n) | O(1) | |
| 19. Remove Nth Node From End of List | Go | Medium | O(n) | O(1) | |
| 21. Merge Two Sorted Lists | Go | Easy | O(log n) | O(1) | |
| 23. Merge k Sorted Lists | Go | Hard | O(log n) | O(1) | ❤️ |
| 24. Swap Nodes in Pairs | Go | Medium | O(n) | O(1) | |
| 25. Reverse Nodes in k-Group | Go | Hard | O(log n) | O(1) | ❤️ |
| 61. Rotate List | Go | Medium | O(n) | O(1) | |
| 82. Remove Duplicates from Sorted List II | Go | Medium | O(n) | O(1) | |
| 83. Remove Duplicates from Sorted List | Go | Easy | O(n) | O(1) | |
| 86. Partition List | Go | Medium | O(n) | O(1) | ❤️ |
| 92. Reverse Linked List II | Go | Medium | O(n) | O(1) | ❤️ |
| 109. Convert Sorted List to Binary Search Tree | Go | Medium | O(log n) | O(n) | |
| 141. Linked List Cycle | Go | Easy | O(n) | O(1) | ❤️ |
| 142. Linked List Cycle II | Go | Medium | O(n) | O(1) | ❤️ |
| 143. Reorder List | Go | Medium | O(n) | O(1) | ❤️ |
| 147. Insertion Sort List | Go | Medium | O(n) | O(1) | |
| 148. Sort List | Go | Medium | O(log n) | O(n) | ❤️ |
| 160. Intersection of Two Linked Lists | Go | Easy | O(n) | O(1) | ❤️ |
| 203. Remove Linked List Elements | Go | Easy | O(n) | O(1) | |
| 206. Reverse Linked List | Go | Easy | O(n) | O(1) | |
| 234. Palindrome Linked List | Go | Easy | O(n) | O(1) | |
| 237. Delete Node in a Linked List | Go | Easy | O(n) | O(1) | |
| 328. Odd Even Linked List | Go | Medium | O(n) | O(1) | |
| 445. Add Two Numbers II | Go | Medium | O(n) | O(n) | |
| 725. Split Linked List in Parts | Go | Medium | O(n) | O(1) | |
| 817. Linked List Components | Go | Medium | O(n) | O(1) | |
| 707. Design Linked List | Go | Easy | O(n) | O(1) | |
| 876. Middle of the Linked List | Go | Easy | O(n) | O(1) | ❤️ |
| 1019. Next Greater Node In Linked List | Go | Medium | O(n) | O(1) | |
