# Status Problem video Level Completes Likes 90 Find Subarray with Sum Equal to a Target Value 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 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 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 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 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 61 Determine If Two Nodes are Cousins Medium % 0 60 Determine if Two BSTs are Identical Beginner % 0 59 Print All Root-to-Leaf Paths in a Binary Tree Medium % 0 57 Sort an Array According to the Order Defined by Another Array Medium % 0 54 Maximum Width of a Binary Tree Medium % 0 51 Print Binary Tree Nodes in Zigzag Order: Spiral Traversal Pattern Hard % 0 49 Find the Unreachable Minimum in Array Subsets Medium % 0 48 Determining Whether a Given Binary Tree is a Binary Search Tree (BST) Medium % 1 44 Inorder Successor in Binary Tree Medium % 0 43 Inorder Successor in Binary Search Tree without Using Parent link Hard % 0 42 Inorder Successor in Binary Search Tree Using Parent link Hard % 0 41 Sorted Array to Binary Search Tree of Minimal Height Medium % 1 40 In a Binary Tree, Create Linked Lists of all the nodes at each depth Hard % 0 38 Determining Binary Tree Balance Medium % 0 37 Get the Height of a Node in a Binary Tree Medium % 0 36 Find the Maximum Depth OR Height of a Binary Tree Beginner % 1 Find Subarray with Sum Equal to a Target Value 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 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 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. Given a binary tree, find out the maximum sum of value from root to each leaf Reversing Alternate Levels in a Binary Tree Given a binary tree, Find the Maximum Path Sum between Any Two Leaves Print Left View of binary tree Determine If Two Nodes are Cousins Determine if Two BSTs are Identical Print All Root-to-Leaf Paths in a Binary Tree Sort an Array According to the Order Defined by Another Array Maximum Width of a Binary Tree Print Binary Tree Nodes in Zigzag Order: Spiral Traversal Pattern Find the Unreachable Minimum in Array Subsets Determining Whether a Given Binary Tree is a Binary Search Tree (BST) Inorder Successor in Binary Tree Inorder Successor in Binary Search Tree without Using Parent link Inorder Successor in Binary Search Tree Using Parent link Sorted Array to Binary Search Tree of Minimal Height In a Binary Tree, Create Linked Lists of all the nodes at each depth Determining Binary Tree Balance Get the Height of a Node in a Binary Tree Find the Maximum Depth OR Height of a Binary Tree 1 2 3 4 5 6 7
