Top 15 Problems in LinkedList # Status Problem video Level Completes Likes 360 Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 Hard % 0 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 186 Reverse a Linked List in groups of given size 'K' Medium % 0 106 Reverse The Doubly Linked List Medium % 0 102 Merge Sort in a Linked list Medium % 0 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 31 Reverse a Linked List - Part 2 Medium % 0 29 Delete a Node in the Middle of a linked list, Given only access to that Node Beginner % 0 22 Find Intersection Point in Two Linked List Medium % 0 17 Merge or Combine Two Sorted Linked Lists Medium % 0 Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 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 Reverse a Linked List in groups of given size 'K' Reverse The Doubly Linked List Merge Sort in a Linked list Convert a Sorted Doubly Linked List to Balanced BST. In a Binary Tree, Create Linked Lists of all the nodes at each depth. Reverse a Linked List - Part 2 Delete a Node in the Middle of a linked list, Given only access to that Node Find Intersection Point in Two Linked List Merge or Combine Two Sorted Linked Lists 1
