# Status Problem Level Completes Likes 1 Insert a node in the given sorted linked list. Beginner % 1 2 Merge K sorted Linked List - Using Priority Queue Hard % 0 3 Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1 Hard % 1 4 Implement Stack Using Linked List Beginner % 0 5 Doubly Linked List Complete Implementation Beginner % 0 6 Circular Linked List Complete Implementation Beginner % 0 7 Swap Nodes in pairs in a Linked List by changing links Medium % 0 8 Reverse Alternative 'k' nodes in a Linked List. Medium % 0 9 Reverse a Linked List in groups of given size 'K' Medium % 0 10 Alternate Splitting of a given Linked List Medium % 0 11 Reverse The Doubly Linked List Medium % 0 12 Swap Kth Node from the front with the Kth Node from the End Medium % 0 13 Delete X Nodes After Y Nodes In a Linked List Beginner % 0 14 Merge Sort in a Linked list Medium % 0 15 Merge a Linked list into another Linked List at Alternate Positions. Medium % 0 16 Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree. Medium % 1 17 Convert a Sorted Doubly Linked List to Balanced BST. Medium % 1 18 In a Binary Tree, Create Linked Lists of all the nodes at each depth. Hard % 0 19 Add two numbers represented by a linked list, Numbers are Stored in FORWARD order Medium % 0 20 Add two numbers represented by a linked list, Numbers are Stored in REVERSE order Medium % 0 21 Reverse a Linked List - Part 2 Medium % 0 22 Swap Every Kth Node in a LinkedList Medium % 0 23 Delete a Node in the Middle of a linked list, Given only access to that Node Beginner % 0 24 Find the n'th Node from the end of a given Linked List Beginner % 0 25 Remove Duplicates from an Unsorted Linked list Beginner % 0 26 Find Intersection Point in Two Linked List Medium % 0 27 Find the Loop in a Linked list, find its length and Break the Loop Medium % 0 28 Reverse a Linked List Beginner % 0 29 Merge or Combine Two Sorted Linked Lists Medium % 0 30 Singly Linked List Implementation Beginner % 0 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 The Doubly Linked List Swap Kth Node from the front with the Kth Node from the End Delete X Nodes After Y Nodes In a Linked List Merge Sort in a Linked list Merge a Linked list into another Linked List at Alternate Positions. Given a Sorted Singly Linked List Array, Convert it into a 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. Add two numbers represented by a linked list, Numbers are Stored in FORWARD order Add two numbers represented by a linked list, Numbers are Stored in REVERSE order Reverse a Linked List - Part 2 Swap Every Kth Node in a LinkedList Delete a Node in the Middle of a linked list, Given only access to that Node Find the n'th Node from the end of a given Linked List Remove Duplicates from an Unsorted Linked list Find Intersection Point in Two Linked List Find the Loop in a Linked list, find its length and Break the Loop Reverse a Linked List Merge or Combine Two Sorted Linked Lists Singly Linked List Implementation 1
