Remove duplicates from a LL
Find Kth to last element of a singly LL
Remove a given node from a singly LL
Partition elements such that all nodes less than x comes before x and greater than or equal after
Change in README
I/P: 7 -> 1 -> 6 and 5 -> 9 -> 2 , which is 617 + 295 = 912 rep as 2 -> 1 -> 9
LL 1 -> 2 -> 3 -> 4 -> 2, print the beginning of the loop, O/P - 2
Check if a LL is a palindrome