Linked List Programming Questions asked in an interview:
Some people find linked list quite a tough topic because of the pointers included, but once you learn the basics well, you can solve any question. Always draw a linked list on a paper with all the addresses of nodes and the next pointers and then find the solution to the problem. It will make your task very easy.
You should know well how to insert at any position, delete at any position, modify a single linked list, double linked list and circular linked list.
Here are some questions asked in interviews:
Reverse a Linked List
Check whether the link list contains a loop
Remove loop in a linked list
Find the middle element in linked list (in O(n) and in one scan)
Find the nth element from the last in the given linked list
Reverse a linked list in groups of given size.
Rotate a linked list
Sort a linked list or Merge two sorted linked lists (Merge Sort)
Check a linked list is palindrome or not.
Clone a given linked list
If you are able to do these problems on your own, your chances of solving a linked list problem in interview becomes 95%. Start practicing as linked list will serve as a base for you to understand higher data structures like trees and graphs. All the best.
