| 1 | Middle of a LinkedList [TortoiseHare Method] |    | | |
| 2 | Reverse a LinkedList [Iterative] |    | | |
| 3 | Reverse a LL [Recursive] |    | | |
| 4 | Detect a loop in LL |    | | |
| 5 | Find the starting point in LL |    | | |
| 6 | Length of Loop in LL |   | | |
| 7 | Check if LL is palindrome or not |    | | |
| 8 | Segrregate odd and even nodes in LL |    | | |
| 9 | Remove Nth node from the back of the LL |    | | |
| 10 | Delete the middle node of LL |    | | |
| 11 | Sort LL |    | | |
| 12 | Sort a LL of 0's 1's and 2's by changing links |   | | |
| 13 | Find the intersection point of Y LL |    | | |
| 14 | Add 1 to a number represented by LL |   | | |
| 15 | Add 2 numbers in LL |    | | |