Must-do problems: Linked Lists

These are the linked list problems every placement candidate should be able to solve, from printing a list to sorting and reordering one. Each program reads the values, builds the nodes, and changes only the links. Draw the nodes for a small input first, then run your program on every test.

1. 1.Ticket queueEasy
2. 2.Order count and totalEasy
3. 3.First position of an itemEasy
4. 4.Add to both endsEasy
5. 5.Remove the first matchEasy
6. 6.Reverse the listEasy
7. 7.Middle of the listEasy
8. 8.Remove every matchMedium
9. 9.Remove duplicates from a sorted listMedium
10. 10.Remove the n-th node from the endMedium
11. 11.Merge two sorted listsMedium
12. 12.Palindrome listMedium
13. 13.Does the list loop?Medium
14. 14.Add two numbers stored as listsMedium
15. 15.Odd positions, then even positionsMedium
16. 16.Where does the loop start?Hard
17. 17.Reverse in groups of kHard
18. 18.Sort the listHard
19. 19.Rotate right by kHard
20. 20.Reorder the listHard