Featured Lists Top 20 Problems on Dynamic programming Top 10 Problems on Backtracking Top 20 Problems on Graph Top 25 Problems on Trees Top 10 Problems on Bits Manipulation Top 15 Problems in LinkedList All Problems # Status Problem video Level Completes Likes 106 Reverse The Doubly Linked List Medium % 0 105 Swap Kth Node from the front with the Kth Node from the End Medium % 0 104 Print the Bottom View of the Binary Tree. Medium % 0 103 Delete X Nodes After Y Nodes In a Linked List Beginner % 0 102 Merge Sort in a Linked list Medium % 0 101 Merge a Linked list into another Linked List at Alternate Positions. Medium % 0 100 AVL Tree - Insertion Hard % 0 99 Construct a binary tree from given Inorder and Level Order Traversal Hard % 0 98 Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Hard % 0 97 Construct Binary Search Tree from a given Preorder Traversal using Recursion Hard % 0 96 Print The Top View of a Binary Tree Medium % 0 95 Construct a Binary Tree from Given Inorder and Depth-First-Search. Hard % 0 94 Depth First Search/Traversal in Binary Tree Beginner % 0 93 Inorder Predecessor and Successor in Binary Search Tree Hard % 0 92 Check if Array Contains All Elements Of Some Given Range Medium % 0 91 Check if Array is Consecutive Integers Beginner % 0 90 Find the subarray with sum to a Given Value. Medium % 0 89 In an Array, find the Smallest Subarray with Sum Greater than the Given Value Medium % 0 88 Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space Hard % 0 87 Find intersection between Two Sorted Arrays. Beginner % 0 86 Find Kth Smallest or Largest element in an Array. Medium % 0 85 Given an array arrA[], find the maximum j – i such that arr[j] > arr[i]. Medium % 0 84 Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number. Hard % 0 83 Search an Element in a Rotated Sorted Array Medium % 0 82 Print All The Nodes Which are X distance from the Given Node Hard % 0 81 Print All The Nodes Which are X distance from the Leaf Nodes Medium % 0 80 Print All The Nodes Which are X distance from the Root Medium % 0 79 Find the Distance between Two Nodes of a Binary Tree. Hard % 0 78 Find The Distance From Root To Given Node of a Binary Tree. Medium % 0 77 Construct a binary tree from given Inorder and Postorder Traversal Hard % 0 76 Print the Vertical Sum in binary Tree Medium % 0 75 Print the Binary Tree in Vertical Order Path. Medium % 0 74 Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). Hard % 0 73 Lowest Common Ancestor in a Binary Search Tree. Medium % 0 72 Make a Binary Tree from Given Inorder and Preorder Traversal Hard % 0 Reverse The Doubly Linked List Swap Kth Node from the front with the Kth Node from the End Print the Bottom View of the Binary Tree. 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. AVL Tree - Insertion Construct a binary tree from given Inorder and Level Order Traversal Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Construct Binary Search Tree from a given Preorder Traversal using Recursion Print The Top View of a Binary Tree Construct a Binary Tree from Given Inorder and Depth-First-Search. Depth First Search/Traversal in Binary Tree Inorder Predecessor and Successor in Binary Search Tree Check if Array Contains All Elements Of Some Given Range Check if Array is Consecutive Integers Find the subarray with sum to a Given Value. In an Array, find the Smallest Subarray with Sum Greater than the Given Value Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space Find intersection between Two Sorted Arrays. Find Kth Smallest or Largest element in an Array. Given an array arrA[], find the maximum j – i such that arr[j] > arr[i]. Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number. Search an Element in a Rotated Sorted Array Print All The Nodes Which are X distance from the Given Node Print All The Nodes Which are X distance from the Leaf Nodes Print All The Nodes Which are X distance from the Root Find the Distance between Two Nodes of a Binary Tree. Find The Distance From Root To Given Node of a Binary Tree. Construct a binary tree from given Inorder and Postorder Traversal Print the Vertical Sum in binary Tree Print the Binary Tree in Vertical Order Path. Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). Lowest Common Ancestor in a Binary Search Tree. Make a Binary Tree from Given Inorder and Preorder Traversal 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16