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
- Open a question in the editor and read the statement, inputs, and expected output. Predict the result for a small example before writing code.
- Write a solution and run the examples. If a result differs from your prediction, reduce the input until you can follow each step.
- 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 totalOpen a question in the editor to read its statement and examples. Sign in to practice.
- Create a Single NodeLinked ListBasic
- Value of Head NodeLinked ListBasic
- Check if Linked List is EmptyLinked ListBasic
- Count Nodes in Linked ListLinked ListBasic
- Convert Linked List to ArrayLinked ListBasic
- Value of Tail NodeLinked ListBasic
- Value of Second NodeLinked ListBasic
- Check if Single Node ListLinked ListBasic
- Sum of All Node ValuesLinked ListBasic
- Product of All Node ValuesLinked ListBasic
- Search for a Value in Linked ListLinked ListBasic
- Maximum Value in Linked ListLinked ListBasic
- Minimum Value in Linked ListLinked ListBasic
- Count Occurrences of a ValueLinked ListBasic
- Get k-th Node Value (0-indexed)Linked ListBasic
- Get k-th Node Value (1-indexed)Linked ListBasic
- Find Index of First OccurrenceLinked ListBasic
- Check if All Nodes Have Identical ValuesLinked ListBasic
- Count Even Value NodesLinked ListBasic
- Count Odd Value NodesLinked ListBasic
- Insert Node at HeadLinked ListBasic
- Delete Head NodeLinked ListBasic
- Update Value of Head NodeLinked ListBasic
- Check if List Has At Least k NodesLinked ListBasic
- Find Index of Last OccurrenceLinked ListBasic
- Insert Node at TailLinked ListBasic
- Update Value of k-th Node (0-indexed)Linked ListBasic
- Check if All Node Values are PositiveLinked ListBasic
- Check if Linked List is Strictly IncreasingLinked ListBasic
- Count Nodes Greater Than a ThresholdLinked ListBasic
- Compare Two Lists for Identical LengthLinked ListBasic
- Compare Two Lists for Identical ElementsLinked ListBasic
- Increment All Node Values by OneLinked ListBasic
- Check if Head Value Equals Tail ValueLinked ListBasic
- Find First Negative Value in Linked ListLinked ListBasic
- Replace All Occurrences of a ValueLinked List · Data Structure DesignBasic
- Sum of Alternate Nodes (Even Indices)Linked ListBasic
- Check if Length is EvenLinked ListBasic
- Range of List (Max - Min)Linked ListBasic
- Count Nodes with Value Equal to IndexLinked ListBasic
- Multiply All Node Values by a FactorLinked ListBasic
- Check if Any Node Has Value ZeroLinked ListBasic
- Second-to-Last Node ValueLinked ListBasic
- Insert Node After HeadLinked ListBasic
- Count Nodes Strictly Less Than a ThresholdLinked ListBasic
- Average of All Node ValuesLinked ListBasic
- Convert Array to Linked ListLinked ListBasic
- Delete Tail NodeLinked ListBasic
- Check if List Has Adjacent Equal ValuesLinked ListBasic
- Clear Linked ListLinked ListBasic
- Parallel Node-Wise Sum of Two ListsLinked ListBasic
- Swap Head and Tail ValuesLinked ListBasic
- Count Nodes Greater Than All Preceding NodesLinked ListBasic
- Deep Copy of Singly Linked ListLinked ListBasic
- Maximum Difference Between Adjacent NodesLinked ListBasic
- Keep Only Positive NodesLinked ListBasic
- Scale Node Values by Distance from HeadLinked ListBasic
- Delete First Occurrence of a ValueLinked ListEasy
- Remove All Elements with ValueLinked ListEasy
- Insert Node at Specific IndexLinked ListEasy
- Middle of the Linked ListLinked ListEasy
- Find k-th Node from EndLinked ListEasy
- Reverse a Singly Linked ListLinked ListEasy
- Merge Two Sorted ListsLinked List · SortingEasy
- Remove Duplicates from Sorted ListLinked List · SortingEasy
- Linked List Cycle DetectionLinked ListEasy
- Delete a Node Without Head PointerLinked ListEasy
- Palindrome Linked ListLinked ListEasy
- Intersection of Two Linked ListsLinked ListEasy
- Convert Binary Number in a Linked List to IntegerLinked ListEasy
- Split a Linked List into Two HalvesLinked ListEasy
- Move Last Node to FrontLinked ListEasy
- Remove Duplicates from an Unsorted Linked ListLinked List · SortingEasy
- Count Cycle LengthLinked ListEasy
- Insert into a Sorted Linked ListLinked List · SortingEasy
- Delete Alternate NodesLinked ListEasy
- Merge Alternating Nodes of Two ListsLinked ListEasy
- Find Left Middle NodeLinked ListEasy
- Segregate Even and Odd Value NodesLinked ListEasy
- Reverse First k NodesLinked ListEasy
- Intersection Elements of Two Sorted ListsLinked List · SortingEasy
- Check if Contiguous SublistLinked ListEasy
- Remove Nodes Greater Than a ThresholdLinked ListEasy
- Check for Alternating ParityLinked ListEasy
- Remove Local PeaksLinked ListEasy
- Compress Contiguous Duplicate Blocks by SumLinked ListEasy
- Check if Two Lists are PermutationsLinked ListEasy
- Median of a Sorted Linked ListLinked List · SortingEasy
- Reverse the Suffix Starting at Position kLinked ListEasy
- Smallest Common Element of Three Sorted ListsLinked List · SortingEasy
- Remove Every k-th NodeLinked ListEasy
- Split List at Position kLinked ListEasy
- Delete N Nodes After M NodesLinked ListEasy
- Segregate 0s, 1s, and 2s by RelinkingLinked ListEasy
- Split into Even and Odd Value SublistsLinked ListEasy
- Move-to-Front List with Access CostsLinked ListEasy
- Remove N-th Node From End of ListLinked ListMedium
- Swap Nodes in PairsLinked ListMedium
- Odd Even Linked ListLinked ListMedium
- Maximum Twin Sum of a Linked ListLinked ListMedium
- Rotate List by k PlacesLinked ListMedium
- Partition List Around Value XLinked ListMedium
- Find Cycle Start NodeLinked ListMedium
- Add One to Number Represented as Linked ListLinked List · ArithmeticMedium
- Add Two NumbersLinked List · ArithmeticMedium
- Reverse Linked List IILinked ListMedium
- Remove Duplicates from Sorted List IILinked List · SortingMedium
- Reorder ListLinked ListMedium
- Copy List with Random PointerLinked ListMedium
- Sort List (Merge Sort on Linked List)Linked List · SortingMedium
- Insertion Sort ListLinked List · SortingMedium
- Add Two Numbers IILinked List · ArithmeticMedium
- Split Linked List in PartsLinked ListMedium
- Swapping Nodes in a Linked ListLinked ListMedium
- Flatten a Multilevel Doubly Linked ListLinked List · Data Structure Design · Doubly / Circular Linked ListMedium
- Next Greater Node in Linked ListLinked List · Monotonic StackMedium
- Delete the Middle Node of a Linked ListLinked ListMedium
- Merge Nodes in Between ZerosLinked ListMedium
- Critical Points and Distances in Linked ListLinked ListMedium
- Remove Nodes with Greater Value on RightLinked ListMedium
- Insert Greatest Common DivisorsLinked List · ArithmeticMedium
- Double a Number Represented as a Linked ListLinked List · ArithmeticMedium
- Convert Sorted List to Binary Search TreeLinked List · Tree · SortingMedium
- Spiral Matrix IVLinked List · Matrix / SimulationMedium
- Merge In Between Linked ListsLinked ListMedium
- Linked List ComponentsLinked ListMedium
- Linked List in Binary TreeLinked List · TreeMedium
- Plus One Linked List (In-Place Forward Pass)Linked ListMedium
- Flatten a Multilevel 2D Linked ListLinked ListMedium
- Linked List Random Node (Reservoir Sampling)Linked List · Randomized AlgorithmsMedium
- Rearrange Linked List in Zig-Zag PatternLinked ListMedium
- Subtract Two Numbers Represented as Linked ListsLinked List · ArithmeticMedium
- Reverse Alternate k NodesLinked ListMedium
- Decimal to Binary in Linked List RepresentationLinked List · ArithmeticMedium
- Design Front Middle Back QueueLinked List · Data Structure DesignMedium
- Design Browser HistoryLinked List · Data Structure DesignMedium
- Rearrange Linked List in Max-Min OrderLinked ListMedium
- Multiply Two Numbers Represented as Linked ListsLinked List · ArithmeticMedium
- LRU Cache (Doubly Linked List + Hash Map)Linked List · Data Structure Design · Doubly / Circular Linked ListMedium
- Check Cyclic Equivalence of Two ListsLinked ListMedium
- Merge k Sorted ListsLinked List · SortingMedium
- Reverse Nodes in Even Length GroupsLinked ListMedium
- Iterative Bottom-Up Merge Sort in O(1) Auxiliary SpaceLinked List · SortingMedium
- Detect and Break Loop in Linked ListLinked ListMedium
- Clone Complex Linked List with Arbitrary Pointers in O(1) SpaceLinked ListMedium
- Maximum Subsegment Sum with At Most One Node DeletionLinked List · Dynamic ProgrammingMedium
- Knuth-Morris-Pratt (KMP) Sublist Matching on Linked ListLinked List · String MatchingMedium
- Continuous Median of a Doubly Linked List StreamLinked List · Data Structure Design · Doubly / Circular Linked ListMedium
- Reverse Nodes in Alternating Blocks of Sizes k and mLinked ListMedium
- Longest Sublist with At Most K Distinct ValuesLinked List · Sliding WindowMedium
- In-Place Binary Radix Sort on Linked ListLinked List · SortingMedium
- Reconstruct Left-Child Right-Sibling Tree Linked ListLinked List · TreeMedium
- XOR Linked List SimulationLinked List · Data Structure Design · Doubly / Circular Linked ListMedium
- Sorted Linked Set with Explicit Logical DeletionLinked List · Serial SimulationMedium
- Length of Longest Palindromic SublistLinked ListHard
- Reverse Nodes in k-GroupLinked ListHard
- LFU (Least Frequently Used) CacheLinked List · Data Structure DesignHard
- All O(1) Data StructureLinked List · Data Structure DesignHard
- Design Skip ListLinked ListHard
- In-Place 3-Way QuickSort on Singly Linked ListLinked List · SortingHard
- Merge k Sorted Circular Doubly Linked ListsLinked List · Data Structure Design · Doubly / Circular Linked List · SortingHard
- Minimum Cuts for Palindromic Partitioning of Linked ListLinked List · Dynamic ProgrammingHard
- Key-Value Store with TTL Using Doubly Linked ListLinked List · Data Structure Design · Doubly / Circular Linked ListHard
- Unrolled Linked List with Node Merging and SplittingLinked List · Data Structure DesignHard
- Fully Persistent Linked List with Branching HistoryLinked ListHard
- Deterministic Express Linked Set with Rebuilt LevelsLinked ListHard
- Linked Rope with Lazy Range ReversalsLinked List · String Data StructureHard
- Dynamic Circular Residual Edge Linked NetworkLinked List · Data Structure Design · Doubly / Circular Linked List · Graph / Network FlowHard
- Compact Relative-Offset Bit-Packed Linked ListLinked List · Data Structure DesignHard
- Knuth's Dancing Links (DLX - Exact Cover Matrix)Linked List · Doubly / Circular Linked List · Backtracking · Exact CoverVery hard