1Merge k Sorted ListsHardLinked ListDivide and ConquerHeap (Priority Queue)
Solve → 2Add Two NumbersMediumLinked ListMathRecursion
Solve → 3Swap Nodes in PairsMediumLinked ListRecursion
Solve → 4Reverse Linked ListEasyLinked ListRecursion
Solve → 5Design a Text EditorHardLinked ListStringStack
Solve → 6Reverse Nodes in k-GroupHardLinked ListRecursion
Solve → 7Populating Next Right Pointers in Each Node IIMediumLinked ListTreeDepth-First Search
Solve → 8Merge k Sorted ListsHardLinked ListDivide and ConquerHeap (Priority Queue)
Solve → 9Swap Nodes in PairsMediumLinked ListRecursion
Solve → 10Reverse Linked ListEasyLinked ListRecursion
Solve → 11Design a Text EditorHardLinked ListStringStack
Solve → 12Add Two NumbersMediumLinked ListMathRecursion
Solve → 13Reverse Nodes in k-GroupHardLinked ListRecursion
Solve → 14Populating Next Right Pointers in Each Node IIMediumLinked ListTreeDepth-First Search
Solve →