Singly Linked List

 

  1. Introduction to Linked List
  2. Linked List vs Array
  3. Linked List Insertion
  4. Linked List Deletion (Deleting a given key)
  5. Linked List Deletion (Deleting a key at given position)
  6. Write a function to delete a Linked List
  7. Find Length of a Linked List (Iterative and Recursive)
  8. Search an element in a Linked List (Iterative and Recursive)
  9. Write a function to get Nth node in a Linked List
  10. Nth node from the end of a Linked List
  11. Print the middle of a given linked list
  12. Write a function that counts the number of times a given int occurs in a Linked List
  13. Detect loop in a linked list
  14. Find length of loop in linked list
  15. Function to check if a singly linked list is palindrome
  16. Remove duplicates from a sorted linked list
  17. Remove duplicates from an unsorted linked list
  18. Swap nodes in a linked list without swapping data
  19. Pairwise swap elements of a given linked list
  20. Move last element to front of a given Linked List
  21. Intersection of two Sorted Linked Lists
  22. Intersection point of two Linked Lists.
  23. QuickSort on Singly Linked List
  24. Segregate even and odd nodes in a Linked List
  25. Reverse a linked list
  26. Recursive function to print reverse of a Linked List
  27. Iteratively Reverse a linked list using only 2 pointers (An Interesting Method)
  28. Merge two sorted linked lists such that merged list is in reverse order
  29. Reverse a Linked List in groups of given size
  30. Reverse a Linked List in groups of given size | Set 2
  31. Reverse alternate K nodes in a Singly Linked List
  32. Alternate Odd and Even Nodes in a Singly Linked List
  33. Delete alternate nodes of a Linked List
  34. Alternating split of a given Singly Linked List
  35. Identical Linked Lists
  36. Delete nodes which have a greater value on right side
  37. Add two numbers represented by linked lists | Set 1
  38. Delete a given node in Linked List under given constraints
  39. Find a triplet from three linked lists with sum equal to a given number
  40. Rotate a Linked List
  41. Flattening a Linked List
  42. Add two numbers represented by linked lists | Set 2
  43. Sort a linked list of 0s, 1s and 2s
  44. Flatten a multilevel linked list
  45. Delete N nodes after M nodes of a linked list
  46. Pairwise swap elements of a given linked list by changing links
  47. Given a linked list of line segments, remove middle points
  48. Clone a linked list with next and random pointer | Set 1
  49. Clone a linked list with next and random pointer | Set 2
  50. Insertion Sort for Singly Linked List
  51. Point to next higher value node in a linked list with an arbitrary pointer
  52. Rearrange a given linked list in-place.
  53. Sort a linked list that is sorted alternating ascending and descending orders.
  54. Select a Random Node from a Singly Linked List
  55. Compare two strings represented as linked lists
  56. Rearrange a linked list such that all even and odd positioned nodes are together
  57. Rearrange a Linked List in Zig-Zag fashion
  58. Add 1 to a number represented as linked list
  59. Point arbit pointer to greatest value right side node in a linked list
  60. Generic Linked List in C
  61. Check if a linked list of strings forms a palindrome
  62. Sort linked list which is already sorted on absolute values
  63. Delete last occurrence of an item from linked list
  64. Delete a Linked List node at a given position
  65. Linked List in java
  66. Decimal Equivalent of Binary Linked List
  67. Flatten a multi-level linked list | Set 2 (Depth wise)
  68. Rearrange a given list such that it consists of alternating minimum maximum elements
  69. Subtract Two Numbers represented as Linked Lists
  70. Find pair for given sum in a sorted singly linked without extra space
  71. Partitioning a linked list around a given value and keeping the original order
  72. Check linked list with a loop is palindrome or not
  73. Clone a linked list with next and random pointer in O(1) space
  74. Length of longest palindrome list in a linked list using O(1) extra space
  75. Adding two polynomials using Linked List
  76. Implementing Iterator pattern of a single Linked List
  77. Move all occurrences of an element to end in a linked list
  78. Remove all occurrences of duplicates from a sorted Linked List
  79. Remove every k-th node of the linked list
  80. Check whether the length of given linked list is Even or Odd
  81. Multiply two numbers represented by Linked Lists
  82. Find the sum of last n nodes of the given Linked List
  83. Count pairs from two linked lists whose sum is equal to a given value
  84. Merge Sort for Linked Lists
  85. Merge two sorted linked lists
  86. Merge a linked list into another linked list at alternate positions
  87. In-place Merge two linked lists without changing links of first list
  88. Delete middle of linked list
  89. Merge K sorted linked lists | Set 1
  90. Merge k sorted linked lists | Set 2 (Using Min Heap)
  91. Merge two sorted lists (in-place)
  92. Union and Intersection of two Linked Lists
  93. Union and Intersection of two linked lists | Set-2 (Using Merge Sort)
  94. Union and Intersection of two linked lists | Set-3 (Hashing)
  95. Recursive selection sort for singly linked list | Swapping node links
  96. Insert node into the middle of the linked list
  97. Sort a linked list of 0s, 1s and 2s by changing links
  98. Insert a node after the n-th node from the end
  99. Rotate Linked List block wise
  100. Count rotations in sorted and rotated linked list
  101. Make middle node head in a linked list

Quick Links :




My Personal Notes arrow_drop_up


Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.