1Max StackHardLinked ListStackDesign
Solve → 2Merge k Sorted ListsHardLinked ListDivide and ConquerHeap (Priority Queue)
Solve → 3Reverse Nodes in k-GroupHardLinked ListRecursion
Solve → 4Middle of the Linked ListEasyLinked ListTwo Pointers
Solve → 5Remove Nth Node From End of ListMediumLinked ListTwo Pointers
Solve → 6Reverse Linked List IIMediumLinked List
Solve → 7Populating Next Right Pointers in Each NodeMediumLinked ListTreeDepth-First Search
Solve → 8Middle of the Linked ListEasyLinked ListTwo Pointers
Solve → 9Max StackHardLinked ListStackDesign
Solve → 10Merge k Sorted ListsHardLinked ListDivide and ConquerHeap (Priority Queue)
Solve → 11Reverse Nodes in k-GroupHardLinked ListRecursion
Solve → 12Remove Nth Node From End of ListMediumLinked ListTwo Pointers
Solve → 13Populating Next Right Pointers in Each NodeMediumLinked ListTreeDepth-First Search
Solve → 14Reverse Linked List IIMediumLinked List
Solve →