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 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 Subarray with Sum Equal to a Target Value Medium % 0 89 Find Smallest Subarray Exceeding a Target Sum Medium % 0 88 Rearrange Array: Positive and Negative Elements Alternating Hard % 0 87 Find Intersection of Two Sorted Arrays Beginner % 0 86 Find Kth Smallest or Largest element in an Array Medium % 0 85 Find Maximum Distance Between Increasing Elements in Array Medium % 0 84 Elements in an Array Occurring More Than N/K Times Hard % 0 83 Find Element in Rotated Sorted Array Medium % 0 82 Find Nodes at Distance X from a Given Node in a Tree Hard % 0 81 Find Nodes X Levels Up from Leaf Nodes in a Tree Medium % 0 80 Find Nodes at Distance X from Root in a Tree Medium % 0 79 Calculate Distance Between Nodes in a Binary Tree Hard % 0 78 Root-to-Node Distance in Binary Tree: How to Find Medium % 0 77 Construct a binary tree from given Inorder and Postorder Traversal Hard % 0 76 Calculate 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 Reversing Alternate Levels in a Binary Tree Medium % 0 69 Convert Sorted Singly Linked List to Balanced Binary Search Tree Medium % 1 68 Transforming a Binary Tree into its Mirror Image Beginner % 0 67 Printing Nodes without Siblings in a Binary Tree 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 binary tree Medium % 0 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 Subarray with Sum Equal to a Target Value Find Smallest Subarray Exceeding a Target Sum Rearrange Array: Positive and Negative Elements Alternating Find Intersection of Two Sorted Arrays Find Kth Smallest or Largest element in an Array Find Maximum Distance Between Increasing Elements in Array Elements in an Array Occurring More Than N/K Times Find Element in Rotated Sorted Array Find Nodes at Distance X from a Given Node in a Tree Find Nodes X Levels Up from Leaf Nodes in a Tree Find Nodes at Distance X from Root in a Tree Calculate Distance Between Nodes in a Binary Tree Root-to-Node Distance in Binary Tree: How to Find Construct a binary tree from given Inorder and Postorder Traversal Calculate 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 Reversing Alternate Levels in a Binary Tree Convert Sorted Singly Linked List to Balanced Binary Search Tree Transforming a Binary Tree into its Mirror Image Printing Nodes without Siblings in a Binary Tree 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 binary tree 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
