1Merge k Sorted ListsHardLinked ListDivide and ConquerHeap (Priority Queue)
Solve → 2Remove Nth Node From End of ListMediumLinked ListTwo Pointers
Solve → 3Add Two NumbersMediumLinked ListMathRecursion
Solve → 4Insert into a Sorted Circular Linked ListMediumLinked List
Solve → 5Merge k Sorted ListsHardLinked ListDivide and ConquerHeap (Priority Queue)
Solve → 6Insert into a Sorted Circular Linked ListMediumLinked List
Solve → 7Add Two NumbersMediumLinked ListMathRecursion
Solve → 8Convert Binary Search Tree to Sorted Doubly Linked ListMediumLinked ListStackTree
Solve → 9Merge k Sorted ListsHardLinked ListDivide and ConquerHeap (Priority Queue)
Solve → 10Remove Nth Node From End of ListMediumLinked ListTwo Pointers
Solve → 11Add Two NumbersMediumLinked ListMathRecursion
Solve → 12Merge Two Sorted ListsEasyLinked ListRecursion
Solve → 13Populating Next Right Pointers in Each NodeMediumLinked ListTreeDepth-First Search
Solve → 14Reverse Linked ListEasyLinked ListRecursion
Solve → 15Flatten Binary Tree to Linked ListMediumLinked ListStackTree
Solve → 16Merge k Sorted ListsHardLinked ListDivide and ConquerHeap (Priority Queue)
Solve → 17Add Two NumbersMediumLinked ListMathRecursion
Solve → 18Remove Nth Node From End of ListMediumLinked ListTwo Pointers
Solve → 19Merge Two Sorted ListsEasyLinked ListRecursion
Solve → 20Flatten Binary Tree to Linked ListMediumLinked ListStackTree
Solve → 21Populating Next Right Pointers in Each NodeMediumLinked ListTreeDepth-First Search
Solve → 22Reverse Linked List IIMediumLinked List
Solve → 23Reverse Nodes in k-GroupHardLinked ListRecursion
Solve → 24Rotate ListMediumLinked ListTwo Pointers
Solve → 25Swap Nodes in PairsMediumLinked ListRecursion
Solve → 26Merge k Sorted ListsHardLinked ListDivide and ConquerHeap (Priority Queue)
Solve → 27Add Two NumbersMediumLinked ListMathRecursion
Solve → 28Remove Nth Node From End of ListMediumLinked ListTwo Pointers
Solve → 29Merge Two Sorted ListsEasyLinked ListRecursion
Solve → 30Reverse Nodes in k-GroupHardLinked ListRecursion
Solve → 31Rotate ListMediumLinked ListTwo Pointers
Solve → 32Reverse Linked List IIMediumLinked List
Solve → 33Convert Sorted List to Binary Search TreeMediumLinked ListDivide and ConquerTree
Solve → 34Swap Nodes in PairsMediumLinked ListRecursion
Solve →