1Merge k Sorted ListsHardLinked ListDivide and ConquerHeap (Priority Queue)
Solve → 2Merge Two Sorted ListsEasyLinked ListRecursion
Solve → 3Populating Next Right Pointers in Each NodeMediumLinked ListTreeDepth-First Search
Solve → 4Populating Next Right Pointers in Each Node IIMediumLinked ListTreeDepth-First Search
Solve → 5Add Two NumbersMediumLinked ListMathRecursion
Solve → 6Merge k Sorted ListsHardLinked ListDivide and ConquerHeap (Priority Queue)
Solve → 7Merge Two Sorted ListsEasyLinked ListRecursion
Solve → 8Populating Next Right Pointers in Each NodeMediumLinked ListTreeDepth-First Search
Solve → 9Populating Next Right Pointers in Each Node IIMediumLinked ListTreeDepth-First Search
Solve → 10Add Two NumbersMediumLinked ListMathRecursion
Solve →