1. Append the specified element to the end of a linked list.
2. Iterate through all elements in a linked list.
3. Iterate through all elements in a linked list starting at the specified position.
4. Iterate a linked list in reverse order.
5. Insert the specified element at the specified position in the linked list.
6. Insert elements into the linked list at the first and last position.
7. Insert the specified element at the front of a linked list.
8. Insert the specified element at the end of a linked list.
9. Insert some elements at the specified position into a linked list.
10. Get the first and last occurrence of the specified elements in a linked list.
11. Display the elements and their positions in a linked list.
12. Remove a specified element from a linked list.
13. Remove the first and last element from a linked list.
14. Remove all the elements from a linked list.
15. Swap two elements in a linked list.
16. Shuffle the elements in a linked list.
17. Join two linked lists.
18. Clone a linked list to another linked list.
19. Remove and return the first element of a linked list.
20. Retrieve but does not remove, the first element of a linked list.
21. Retrieve but does not remove, the last element of a linked list.
22. Check if a particular element exists in a linked list.
23. Convert a linked list to array list.
24. Compare two linked lists.
25. Test a linked list is empty or not.
26. Replace an element in a linked list.