# Top 20 Linked List Interview Question

- Print the Middle of a given linked list
- Flattening a linked list
- Delete the elements in an linked list whose sum is equal to zero
- Delete middle of linked list
- Remove duplicate elements from sorted linked list
- Add 1 to a number represented as a linked list
- Reverse a linked list in groups of given size
- Detect loop in linked list
- Remove loop in linked list
- Find nth node from the end of linked list
- Function to check if a singly linked list is a palindrome
- Reverse alternate k node in a singly linked list
- Delete last occurrence of an item from linked list
- Rotate a linked list.
- Delete n nodes after m nodes of a linked list.
- Merge a linked list into another linked list at alternate positions.
- Write a function to delete a linked list.
- Write a function to reverse the nodes of a linked list.
- Why quicksort is preferred for arrays and merge sort for linked lists.
- linked list in java

This article is contributed by **Ayushmaan Bansal**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

## Recommended Posts:

- Create new linked list from two given linked list with greater element at each node
- XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
- Convert singly linked list into circular linked list
- XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
- Difference between Singly linked list and Doubly linked list
- Merge a linked list into another linked list at alternate positions
- Convert Singly Linked List to XOR Linked List
- Check if a linked list is Circular Linked List
- Construct a Maximum Sum Linked List out of two Sorted Linked Lists having some Common nodes
- Create a linked list from two linked lists by choosing max element at each position
- Length of longest palindrome list in a linked list using O(1) extra space
- Partitioning a linked list around a given value and If we don't care about making the elements of the list "stable"
- Rotate the sub-list of a linked list from position M to N to the right by K places
- Linked List Sum of Nodes Between 0s
- First non-repeating in a linked list