# Status Problem video Level Completes Likes 551 Reverse a linked list using stack Medium % 0 461 Insert a node in the given sorted linked list. Beginner % 1 359 Merge K sorted Linked List - Using Priority Queue Hard % 0 351 Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1 Hard % 1 193 Implement Stack Using Linked List Beginner % 0 192 Doubly Linked List Complete Implementation Beginner % 0 191 Circular Linked List Complete Implementation Beginner % 0 190 Swap Nodes in pairs in a Linked List by changing links Medium % 0 187 Reverse Alternative 'k' nodes in a Linked List. Medium % 0 186 Reverse a Linked List in groups of given size 'K' Medium % 0 107 Alternate Splitting of a given Linked List Medium % 0 106 Reverse a Doubly-Linked List (In-place Algorithm) Medium % 0 105 Swapping Nodes in a Linked List (Kth Position) Medium % 0 103 Delete X Nodes After Y Nodes In a Linked List Beginner % 0 102 Merge Sort for Linked Lists (In-place Algorithm) Medium % 0 101 Merge a Linked list into another Linked List at Alternate Positions Medium % 0 69 Convert Sorted Singly Linked List to Balanced Binary Search Tree Medium % 1 66 Convert a Sorted Doubly Linked List to Balanced BST Medium % 1 40 In a Binary Tree, Create Linked Lists of all the nodes at each depth Hard % 0 35 Adding Two Numbers with Linked Lists Medium % 0 Reverse a linked list using stack Insert a node in the given sorted linked list. Merge K sorted Linked List - Using Priority Queue Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1 Implement Stack Using Linked List Doubly Linked List Complete Implementation Circular Linked List Complete Implementation Swap Nodes in pairs in a Linked List by changing links Reverse Alternative 'k' nodes in a Linked List. Reverse a Linked List in groups of given size 'K' Alternate Splitting of a given Linked List Reverse a Doubly-Linked List (In-place Algorithm) Swapping Nodes in a Linked List (Kth Position) Delete X Nodes After Y Nodes In a Linked List Merge Sort for Linked Lists (In-place Algorithm) Merge a Linked list into another Linked List at Alternate Positions Convert Sorted Singly Linked List to Balanced Binary Search Tree Convert a Sorted Doubly Linked List to Balanced BST In a Binary Tree, Create Linked Lists of all the nodes at each depth Adding Two Numbers with Linked Lists 1 2
