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 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 71 Given a binary tree, find out the maximum sum of value from root to each leaf. Medium % 0 70 Reverse Alternate levels of a given Binary Tree. Medium % 0 69 Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree. Medium % 1 68 Given a binary tree, Convert it into its Mirror Tree Beginner % 0 67 Given a binary tree, Print All the Nodes that don't have Siblings. Beginner % 0 66 Convert a Sorted Doubly Linked List to Balanced BST. Medium % 1 65 Given a binary tree, Find the Maximum Path Sum between Any Two Leaves Medium % 0 64 Print Left View of a given binary tree Medium % 0 63 Print Right View of a given binary tree Medium % 0 62 In a Binary Tree, Check if Two nodes has the same parent or are siblings Medium % 0 61 In a Binary Tree, Check if two nodes are Cousins Medium % 0 60 Check if Two BST's are Identical Beginner % 0 59 Print Paths from root to all leaf nodes in a binary tree. Medium % 0 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 Given a binary tree, find out the maximum sum of value from root to each leaf. Reverse Alternate levels of a given Binary Tree. Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree. Given a binary tree, Convert it into its Mirror Tree Given a binary tree, Print All the Nodes that don't have Siblings. Convert a Sorted Doubly Linked List to Balanced BST. Given a binary tree, Find the Maximum Path Sum between Any Two Leaves Print Left View of a given binary tree Print Right View of a given binary tree In a Binary Tree, Check if Two nodes has the same parent or are siblings In a Binary Tree, Check if two nodes are Cousins Check if Two BST's are Identical Print Paths from root to all leaf nodes in a binary tree. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16