Skip to content

Linked List

Traversing Linked List

  • 1290.Convert Binary Number in a Linked List to Integer
  • 2058.Find the Minimum and Maximum Number of Nodes Between Critical Points
  • 2181.Merge Nodes in Between Zeros
  • 725.Split Linked List in Parts
  • 817.Linked List Components
  • 3062.Linked List Winner (Premium)
  • 3063.Linked List Frequency (Premium)

Deleting Nodes

  • 203.Remove Linked List Elements
  • 3217.Remove Nodes From a Linked List Present in an Array
  • 83.Remove Duplicates from Sorted List
  • 82.Remove Duplicates from Sorted List II
  • 237.Delete Node in a Linked List
  • 1669.Merge In Between Linked Lists
  • 2487.Remove Nodes from Linked List
  • 1836.Remove Duplicates From an Unsorted Linked List (Premium)

Inserting Nodes

  • 2807.Insert Greatest Common Divisors in Linked List
  • 147.Insertion Sort List
  • LCR 029.Insert Into a Cyclic Sorted List
  • 708.Insert Into a Cyclic Sorted List (Premium)
  • 2046.Sort a Linked List by Absolute Values (Premium)

Reversing Linked List

  • 206.Reverse Linked List https://youtu.be/-h01GaRDIhQ
  • 92.Reverse Linked List II https://youtu.be/LwzILIXjDXw
  • 24.Swap Nodes in Pairs
  • 25.Reverse Nodes in k-Group
  • 2074.Reverse Nodes in Even Length Groups

Front-Back Pointers

  • 19.Remove Nth Node From End of List
  • 61.Rotate List
  • 1721.Swapping Nodes in a Linked List
  • 1474.Delete N Nodes After M Nodes of a Linked List (Premium)

Fast-Slow Pointers

  • 876.Middle of the Linked List
  • 2095.Delete the Middle Node of a Linked List
  • 234.Palindrome Linked List
  • 2130.Maximum Twin Sum of a Linked List
  • 143.Reorder List
  • 141.Linked List Cycle
  • 142.Linked List Cycle II
  • 457.Circular Array Loop
  • 2674.Split Circular Linked List (Premium)

Double Pointers

  • 328.Odd Even Linked List
  • 86.Partition List
  • 160.Intersection of Two Linked Lists

Merging Linked Lists

  • 2.Add Two Numbers
  • 445.Add Two Numbers II
  • 2816.Double a Number Represented as a Linked List
  • 21.Merge Two Sorted Lists
  • 369.Plus One Linked List (Premium)
  • 1634.Add Two Polynomials Represented as Linked Lists (Premium)

Divide and Conquer

  • 23.Merge k Sorted Lists
  • 148.Sort List

Advanced Applications

  • 1019.Next Greater Node In Linked List
  • 1171.Remove Zero Sum Consecutive Nodes from Linked List
  • 707.Design Linked List
  • 146.LRU Cache
  • 460.LFU Cache
  • 432.All O(1) Data Structure
  • 1206.Design Skiplist

Others

  • 138.Copy List with Random Pointer
  • 382.Linked List Random Node
  • 430.Flatten a Multilevel Doubly Linked List
  • 1265.Print Immutable Linked List in Reverse (Premium)