1Reverse Nodes in k-GroupHardLinked ListRecursion
Solve → 2Reverse Nodes in k-GroupHardLinked ListRecursion
Solve → 3Reverse Nodes in k-GroupHardLinked ListRecursion
Solve → 4Merge k Sorted ListsHardLinked ListDivide and ConquerHeap (Priority Queue)
Solve → 5Reorder ListMediumLinked ListTwo PointersStack
Solve → 6Reverse Linked ListEasyLinked ListRecursion
Solve → 7Reverse Nodes in k-GroupHardLinked ListRecursion
Solve → 8Convert Binary Search Tree to Sorted Doubly Linked ListMediumLinked ListStackTree
Solve → 9Swap Nodes in PairsMediumLinked ListRecursion
Solve → 10Merge Two Sorted ListsEasyLinked ListRecursion
Solve → 11Reverse Linked List IIMediumLinked List
Solve → 12Remove Nth Node From End of ListMediumLinked ListTwo Pointers
Solve → 13Max StackHardLinked ListStackDesign
Solve → 14Add Two NumbersMediumLinked ListMathRecursion
Solve → 15Sort ListMediumLinked ListTwo PointersDivide and Conquer
Solve → 16Add Two Numbers IIMediumLinked ListMathStack
Solve → 17Insert into a Sorted Circular Linked ListMediumLinked List
Solve → 18Merge In Between Linked ListsMediumLinked List
Solve → 19Remove Duplicates from Sorted List IIMediumLinked ListTwo Pointers
Solve → 20Merge k Sorted ListsHardLinked ListDivide and ConquerHeap (Priority Queue)
Solve → 21Reorder ListMediumLinked ListTwo PointersStack
Solve → 22Reverse Linked ListEasyLinked ListRecursion
Solve → 23Reverse Nodes in k-GroupHardLinked ListRecursion
Solve → 24Convert Binary Search Tree to Sorted Doubly Linked ListMediumLinked ListStackTree
Solve → 25Swap Nodes in PairsMediumLinked ListRecursion
Solve → 26Merge Two Sorted ListsEasyLinked ListRecursion
Solve → 27Reverse Linked List IIMediumLinked List
Solve → 28Sort ListMediumLinked ListTwo PointersDivide and Conquer
Solve → 29Remove Nth Node From End of ListMediumLinked ListTwo Pointers
Solve → 30Max StackHardLinked ListStackDesign
Solve → 31Merge In Between Linked ListsMediumLinked List
Solve → 32Add Two NumbersMediumLinked ListMathRecursion
Solve → 33Add Two Numbers IIMediumLinked ListMathStack
Solve → 34Insert into a Sorted Circular Linked ListMediumLinked List
Solve → 35Remove Duplicates from Sorted List IIMediumLinked ListTwo Pointers
Solve →