Linked List – Interview Questions and Practice Problems

A linked list is a linear data structure consisting of a group of nodes where each node points to the next node through a pointer. Each node is composed of data and a reference (in other words, a link) to the next node in the sequence.

1. Introduction to Linked ListsBeginner
2. Linked List Implementation – C, C++, Java, PythonBeginner
3. Linked List – Insertion at TailBeginner
4. Static Linked ListBeginner
5. Clone a Linked ListEasy
6. Delete a linked listEasy
7. Pop operation in a linked listEasy
8. Insert a node to its correct sorted position in a sorted linked listEasy
9. Rearrange linked list in increasing order (Sort linked list)Medium
10. Split nodes of a linked list into the front and back halvesEasy
11. Remove duplicates from a sorted linked listEasy
12. Move the front node of a linked list in front of another listEasy
13. Move even nodes to the end of the linked list in reverse orderMedium
14. Split a linked list into two lists where each list contains alternating elements from itMedium
15. Construct a linked list by merging alternate nodes of two given listsEasy
16. Merge two sorted linked lists into oneMedium
17. Efficiently merge k sorted linked listsHard
18. Intersection of two sorted linked listsMedium
19. Reverse a linked List – Iterative SolutionMedium
20. Reverse a Linked List – Recursive SolutionHard
21. Reverse every group of k nodes in a linked listMedium
22. Find k’th node from the end of a linked listEasy
23. Merge alternate nodes of two linked lists into the first listMedium
24. Merge two sorted linked lists from their endMedium
25. Delete every N nodes in a linked list after skipping M nodesEasy
26. Rearrange linked list in a specific manner in linear timeMedium
27. Check if a linked list is palindrome or notMedium
28. Move the last node to the front of a linked listEasy
29. Rearrange linked list in a specific mannerEasy
30. Detect cycle in a linked list (Floyd’s Cycle Detection Algorithm)Easy
31. Sort linked list containing 0’s, 1’s, and 2’s in a single traversalMedium
32. Remove duplicates from a linked list in a single traversalEasy
33. Rearrange linked list so that it has alternating high and low valuesMedium
34. Rearrange a linked list by separating odd nodes from even onesMedium
35. Calculate the height of a binary tree with leaf nodes forming a circular doubly linked listMedium
36. XOR Linked List – Overview and Implementation in C/C++Medium
37. Recursively check if the linked list of characters is palindrome or notMedium
38. Merge two BSTs into a doubly-linked list in sorted orderHard
39. Remove redundant nodes from a path formed by a linked listMedium
40. Add a single-digit number to a linked list representing a numberMedium
41. Reverse every alternate group of k nodes in a linked listMedium
42. Determine whether a linked list is palindrome or notMedium
43. Reverse a doubly linked listEasy
44. Pairwise swap adjacent nodes of a linked listMedium
45. Flatten a Linked ListHard
46. Check if a linked list of strings is palindromicEasy
47. Flatten a multilevel linked listMedium
48. Construct a height-balanced BST from an unbalanced BSTHard
49. Swap k’th node from beginning with k’th node from the end in a linked listMedium
50. Add two linked lists without using any extra spaceMedium
51. Clone a linked list with random pointerHard
52. Update random pointer for each linked list node to point to the maximum nodeMedium
53. Link nodes present in each level of a binary tree in the form of a linked listHard
54. Convert a ternary tree to a doubly-linked listMedium
55. Construct a height-balanced BST from a sorted doubly linked listHard
56. In-place merge two sorted linked lists without modifying links of the first listMedium
57. Reverse specified portion of a linked listMedium
58. Find the intersection point of two linked listsMedium
59. Extract leaves of a binary tree into a doubly-linked listMedium
60. Find the vertical sum of a binary treeHard
61. In-place convert a binary tree to a doubly-linked listHard
62. Find a triplet with the given sum in a BSTHard
63. Check whether the leaf traversal of given binary trees is the same or notHard
64. Merge sort algorithm for a singly linked listHard
65. Sort a doubly-linked list using merge sortMedium
66. Stack Implementation using a Linked ListBeginner
67. Queue Implementation using a Linked ListBeginner
68. Convert a binary tree into a doubly-linked list in spiral orderHard
69. Convert a Binary Search Tree into a Min HeapHard
70. Convert a multilevel linked list to a singly linked listMedium
71. Print nodes of a binary tree in vertical orderMedium