DSAWiser

DSA question set · 170 questions

Linked List DSA Practice Questions

Explore 170 DSA questions in Linked List. Practice with DSAWiser’s code editor and visualizer.

Linked ListData Structure DesignSortingArithmeticDoubly / Circular Linked ListMonotonic StackTreeMatrix / SimulationRandomized AlgorithmsDynamic ProgrammingString MatchingSliding WindowSerial SimulationString Data StructureGraph / Network FlowBacktrackingExact Cover

What’s in this set

The Linked List collection contains 170 problems: 57 basic, 39 easy, 58 medium, 15 hard, 1 very hard. Choose a question at your current level, or follow the collection’s order below.

Topics in this collection include Linked List, Data Structure Design, Sorting, Arithmetic, Doubly / Circular Linked List. Each question shows its own topics and difficulty so you can decide where to begin.

Practice with the code visualizer

  1. Open a question in the editor and read the statement, inputs, and expected output. Predict the result for a small example before writing code.
  2. Write a solution and run the examples. If a result differs from your prediction, reduce the input until you can follow each step.
  3. Step through your code in the visualizer. Use a breakpoint to inspect the state at a specific line, then compare it with your reasoning.

Questions in this set

170 total

Open a question in the editor to read its statement and examples. Sign in to practice.

  1. Create a Single NodeLinked ListBasic
  2. Value of Head NodeLinked ListBasic
  3. Check if Linked List is EmptyLinked ListBasic
  4. Count Nodes in Linked ListLinked ListBasic
  5. Convert Linked List to ArrayLinked ListBasic
  6. Value of Tail NodeLinked ListBasic
  7. Value of Second NodeLinked ListBasic
  8. Check if Single Node ListLinked ListBasic
  9. Sum of All Node ValuesLinked ListBasic
  10. Product of All Node ValuesLinked ListBasic
  11. Search for a Value in Linked ListLinked ListBasic
  12. Maximum Value in Linked ListLinked ListBasic
  13. Minimum Value in Linked ListLinked ListBasic
  14. Count Occurrences of a ValueLinked ListBasic
  15. Get k-th Node Value (0-indexed)Linked ListBasic
  16. Get k-th Node Value (1-indexed)Linked ListBasic
  17. Find Index of First OccurrenceLinked ListBasic
  18. Check if All Nodes Have Identical ValuesLinked ListBasic
  19. Count Even Value NodesLinked ListBasic
  20. Count Odd Value NodesLinked ListBasic
  21. Insert Node at HeadLinked ListBasic
  22. Delete Head NodeLinked ListBasic
  23. Update Value of Head NodeLinked ListBasic
  24. Check if List Has At Least k NodesLinked ListBasic
  25. Find Index of Last OccurrenceLinked ListBasic
  26. Insert Node at TailLinked ListBasic
  27. Update Value of k-th Node (0-indexed)Linked ListBasic
  28. Check if All Node Values are PositiveLinked ListBasic
  29. Check if Linked List is Strictly IncreasingLinked ListBasic
  30. Count Nodes Greater Than a ThresholdLinked ListBasic
  31. Compare Two Lists for Identical LengthLinked ListBasic
  32. Compare Two Lists for Identical ElementsLinked ListBasic
  33. Increment All Node Values by OneLinked ListBasic
  34. Check if Head Value Equals Tail ValueLinked ListBasic
  35. Find First Negative Value in Linked ListLinked ListBasic
  36. Replace All Occurrences of a ValueLinked List · Data Structure DesignBasic
  37. Sum of Alternate Nodes (Even Indices)Linked ListBasic
  38. Check if Length is EvenLinked ListBasic
  39. Range of List (Max - Min)Linked ListBasic
  40. Count Nodes with Value Equal to IndexLinked ListBasic
  41. Multiply All Node Values by a FactorLinked ListBasic
  42. Check if Any Node Has Value ZeroLinked ListBasic
  43. Second-to-Last Node ValueLinked ListBasic
  44. Insert Node After HeadLinked ListBasic
  45. Count Nodes Strictly Less Than a ThresholdLinked ListBasic
  46. Average of All Node ValuesLinked ListBasic
  47. Convert Array to Linked ListLinked ListBasic
  48. Delete Tail NodeLinked ListBasic
  49. Check if List Has Adjacent Equal ValuesLinked ListBasic
  50. Clear Linked ListLinked ListBasic
  51. Parallel Node-Wise Sum of Two ListsLinked ListBasic
  52. Swap Head and Tail ValuesLinked ListBasic
  53. Count Nodes Greater Than All Preceding NodesLinked ListBasic
  54. Deep Copy of Singly Linked ListLinked ListBasic
  55. Maximum Difference Between Adjacent NodesLinked ListBasic
  56. Keep Only Positive NodesLinked ListBasic
  57. Scale Node Values by Distance from HeadLinked ListBasic
  58. Delete First Occurrence of a ValueLinked ListEasy
  59. Remove All Elements with ValueLinked ListEasy
  60. Insert Node at Specific IndexLinked ListEasy
  61. Middle of the Linked ListLinked ListEasy
  62. Find k-th Node from EndLinked ListEasy
  63. Reverse a Singly Linked ListLinked ListEasy
  64. Merge Two Sorted ListsLinked List · SortingEasy
  65. Remove Duplicates from Sorted ListLinked List · SortingEasy
  66. Linked List Cycle DetectionLinked ListEasy
  67. Delete a Node Without Head PointerLinked ListEasy
  68. Palindrome Linked ListLinked ListEasy
  69. Intersection of Two Linked ListsLinked ListEasy
  70. Convert Binary Number in a Linked List to IntegerLinked ListEasy
  71. Split a Linked List into Two HalvesLinked ListEasy
  72. Move Last Node to FrontLinked ListEasy
  73. Remove Duplicates from an Unsorted Linked ListLinked List · SortingEasy
  74. Count Cycle LengthLinked ListEasy
  75. Insert into a Sorted Linked ListLinked List · SortingEasy
  76. Delete Alternate NodesLinked ListEasy
  77. Merge Alternating Nodes of Two ListsLinked ListEasy
  78. Find Left Middle NodeLinked ListEasy
  79. Segregate Even and Odd Value NodesLinked ListEasy
  80. Reverse First k NodesLinked ListEasy
  81. Intersection Elements of Two Sorted ListsLinked List · SortingEasy
  82. Check if Contiguous SublistLinked ListEasy
  83. Remove Nodes Greater Than a ThresholdLinked ListEasy
  84. Check for Alternating ParityLinked ListEasy
  85. Remove Local PeaksLinked ListEasy
  86. Compress Contiguous Duplicate Blocks by SumLinked ListEasy
  87. Check if Two Lists are PermutationsLinked ListEasy
  88. Median of a Sorted Linked ListLinked List · SortingEasy
  89. Reverse the Suffix Starting at Position kLinked ListEasy
  90. Smallest Common Element of Three Sorted ListsLinked List · SortingEasy
  91. Remove Every k-th NodeLinked ListEasy
  92. Split List at Position kLinked ListEasy
  93. Delete N Nodes After M NodesLinked ListEasy
  94. Segregate 0s, 1s, and 2s by RelinkingLinked ListEasy
  95. Split into Even and Odd Value SublistsLinked ListEasy
  96. Move-to-Front List with Access CostsLinked ListEasy
  97. Remove N-th Node From End of ListLinked ListMedium
  98. Swap Nodes in PairsLinked ListMedium
  99. Odd Even Linked ListLinked ListMedium
  100. Maximum Twin Sum of a Linked ListLinked ListMedium
  101. Rotate List by k PlacesLinked ListMedium
  102. Partition List Around Value XLinked ListMedium
  103. Find Cycle Start NodeLinked ListMedium
  104. Add One to Number Represented as Linked ListLinked List · ArithmeticMedium
  105. Add Two NumbersLinked List · ArithmeticMedium
  106. Reverse Linked List IILinked ListMedium
  107. Remove Duplicates from Sorted List IILinked List · SortingMedium
  108. Reorder ListLinked ListMedium
  109. Copy List with Random PointerLinked ListMedium
  110. Sort List (Merge Sort on Linked List)Linked List · SortingMedium
  111. Insertion Sort ListLinked List · SortingMedium
  112. Add Two Numbers IILinked List · ArithmeticMedium
  113. Split Linked List in PartsLinked ListMedium
  114. Swapping Nodes in a Linked ListLinked ListMedium
  115. Flatten a Multilevel Doubly Linked ListLinked List · Data Structure Design · Doubly / Circular Linked ListMedium
  116. Next Greater Node in Linked ListLinked List · Monotonic StackMedium
  117. Delete the Middle Node of a Linked ListLinked ListMedium
  118. Merge Nodes in Between ZerosLinked ListMedium
  119. Critical Points and Distances in Linked ListLinked ListMedium
  120. Remove Nodes with Greater Value on RightLinked ListMedium
  121. Insert Greatest Common DivisorsLinked List · ArithmeticMedium
  122. Double a Number Represented as a Linked ListLinked List · ArithmeticMedium
  123. Convert Sorted List to Binary Search TreeLinked List · Tree · SortingMedium
  124. Spiral Matrix IVLinked List · Matrix / SimulationMedium
  125. Merge In Between Linked ListsLinked ListMedium
  126. Linked List ComponentsLinked ListMedium
  127. Linked List in Binary TreeLinked List · TreeMedium
  128. Plus One Linked List (In-Place Forward Pass)Linked ListMedium
  129. Flatten a Multilevel 2D Linked ListLinked ListMedium
  130. Linked List Random Node (Reservoir Sampling)Linked List · Randomized AlgorithmsMedium
  131. Rearrange Linked List in Zig-Zag PatternLinked ListMedium
  132. Subtract Two Numbers Represented as Linked ListsLinked List · ArithmeticMedium
  133. Reverse Alternate k NodesLinked ListMedium
  134. Decimal to Binary in Linked List RepresentationLinked List · ArithmeticMedium
  135. Design Front Middle Back QueueLinked List · Data Structure DesignMedium
  136. Design Browser HistoryLinked List · Data Structure DesignMedium
  137. Rearrange Linked List in Max-Min OrderLinked ListMedium
  138. Multiply Two Numbers Represented as Linked ListsLinked List · ArithmeticMedium
  139. LRU Cache (Doubly Linked List + Hash Map)Linked List · Data Structure Design · Doubly / Circular Linked ListMedium
  140. Check Cyclic Equivalence of Two ListsLinked ListMedium
  141. Merge k Sorted ListsLinked List · SortingMedium
  142. Reverse Nodes in Even Length GroupsLinked ListMedium
  143. Iterative Bottom-Up Merge Sort in O(1) Auxiliary SpaceLinked List · SortingMedium
  144. Detect and Break Loop in Linked ListLinked ListMedium
  145. Clone Complex Linked List with Arbitrary Pointers in O(1) SpaceLinked ListMedium
  146. Maximum Subsegment Sum with At Most One Node DeletionLinked List · Dynamic ProgrammingMedium
  147. Knuth-Morris-Pratt (KMP) Sublist Matching on Linked ListLinked List · String MatchingMedium
  148. Continuous Median of a Doubly Linked List StreamLinked List · Data Structure Design · Doubly / Circular Linked ListMedium
  149. Reverse Nodes in Alternating Blocks of Sizes k and mLinked ListMedium
  150. Longest Sublist with At Most K Distinct ValuesLinked List · Sliding WindowMedium
  151. In-Place Binary Radix Sort on Linked ListLinked List · SortingMedium
  152. Reconstruct Left-Child Right-Sibling Tree Linked ListLinked List · TreeMedium
  153. XOR Linked List SimulationLinked List · Data Structure Design · Doubly / Circular Linked ListMedium
  154. Sorted Linked Set with Explicit Logical DeletionLinked List · Serial SimulationMedium
  155. Length of Longest Palindromic SublistLinked ListHard
  156. Reverse Nodes in k-GroupLinked ListHard
  157. LFU (Least Frequently Used) CacheLinked List · Data Structure DesignHard
  158. All O(1) Data StructureLinked List · Data Structure DesignHard
  159. Design Skip ListLinked ListHard
  160. In-Place 3-Way QuickSort on Singly Linked ListLinked List · SortingHard
  161. Merge k Sorted Circular Doubly Linked ListsLinked List · Data Structure Design · Doubly / Circular Linked List · SortingHard
  162. Minimum Cuts for Palindromic Partitioning of Linked ListLinked List · Dynamic ProgrammingHard
  163. Key-Value Store with TTL Using Doubly Linked ListLinked List · Data Structure Design · Doubly / Circular Linked ListHard
  164. Unrolled Linked List with Node Merging and SplittingLinked List · Data Structure DesignHard
  165. Fully Persistent Linked List with Branching HistoryLinked ListHard
  166. Deterministic Express Linked Set with Rebuilt LevelsLinked ListHard
  167. Linked Rope with Lazy Range ReversalsLinked List · String Data StructureHard
  168. Dynamic Circular Residual Edge Linked NetworkLinked List · Data Structure Design · Doubly / Circular Linked List · Graph / Network FlowHard
  169. Compact Relative-Offset Bit-Packed Linked ListLinked List · Data Structure DesignHard
  170. Knuth's Dancing Links (DLX - Exact Cover Matrix)Linked List · Doubly / Circular Linked List · Backtracking · Exact CoverVery hard