Linked List Problems

  1. Creation of Linked List
  2. Print Elements of Linked List
  3. Insert element at beginning/front
  4. Insert element at given position
  5. Delete Last Node of List
  6. Delete Front Node of List
  7. Delete Element at Given Position
  8. Get Size of Linked List
  9. Search Node in Linked List
  10. Rotate the Linked List in Clockwise by K-nodes
  11. Rotate the Linked List in Anti-Clockwise by K-nodes
  12. Reverse Linked List Recursively
  13. Reverse the Linked List iteratively
  14. Reverse list in Group of K elements
  15. Reverse list alternatively in Group of K elements
  16. Get Middle Node of Linked List
  17. Sort the Linked List 
  18. Merge two Linked List
  19. Merge two Sorted Linked List
  20. Get Union set of two Linked Lists
  21. Get Intersection set of two Linked Lists
  22. Get Lowest Common Element Of Two Linked Lists
  23. Remove Duplicate elements from a Sorted Linked List
  24. Remove Duplicate items from Unsorted Linked list Using Sorting
  25. Remove Duplicate Items from unsorted linked list using HashMap
  26. Delete N nodes after M Nodes of a Linked List
  27. Flatten a Sorted multilevel linked list
  28. Get Kth Node from Linked List
  29. Get Kth Last Node of Linked List
  30. Check if loop present in Linked list
  31. Detect & get Length of loop in linked list
  32. Detect & Remove Loop in linked list
  33. Delete Middle Node of Linked List
  34. Check if First & Second Half elements are Matching in Linked List
  35. Check if linked list is Palindrome
  36. Delete the Linked List
  37. Delete nodes which have greater values on the right
  38. Check if two Linked Lists are identical
  39. Pairwise Swap elements of a Linked List
  40. Delete alternate nodes in Linked List
  41. Move last node to the Front
  42. Count occurrence of a value
  43. Swap nodes of given values without swapping data
  44. Get intersection point of two unsorted Linked List
  45. Separate even and odd nodes in Linked list
  46. Split Linked List Alternatively into two lists
  47. Pairwise Swap Nodes of a Linked List
  48. Merge Two Linked List Alternatively
  49. Sort Linked List of items only 0s, 1s & 2s
  50. Add 1 to a number represented as linked list
  51. Check if triplet exists from lists with given sum
  52. Add two number represented as linked list using reverse
  53. Add two number represented as linked list through recursion
  54. Subtract two numbers represented as linked list
  55. Make Middle Node as Head of Linked list
  56. Insert Node into Middle of Linked List
  57. Count rotations in sorted & rotated linked list
  58. Merge K-Sorted Linked List
  59. Union of Two Linked Lists using Hashing
  60. Intersection of two Linked List using Hashing
  61. Count pairs equal to given sum from two linked lists
  62. Sum of all nodes of Linked lists
  63. Find sum of Last n nodes in Linked List
  64. Check if length of nodes is even in linked list
  65. Remove every kth Node in Linked list
  66. Delete the node when this node is given
  67. Delete the last occurrence of an element in linked list
  68. Sort linked list which is already sorted on absolute value
  69. Clone linked list with next & random pointer
  70. Merge two Sorted Linked list in reverse order
  71. Move all occurrences of an element to the end of list
  72. Rearrange a Linked List in Zig-Zag fashion
  73. Flatten a multi level Linked list level wise
  74. Flatten a multi level Linked list depth wise
  75. Rearrange a given linked list in-place
  76. Rearrange a given linked list alternatively min max element
  77. Rearrange a linked list around a given value and keeping the original order
  78. Point to next higher value node in a linked list with an arbitrary pointer
  79. Alternate Odd & Even nodes in a Singly linked lists
  80. Check if a linked list of string forms a palindrome
  81. Compare two strings represented as linked lists
  82. Length of longest palindrome list in a linked list
  83. Get Largest/Smallest element in Linked List
  84. Delete Largest element from Linked list

Leave a Reply

Your email address will not be published. Required fields are marked *