# Status Problem video Level Completes Likes 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 78 Root-to-Node Distance in Binary Tree: How to Find Medium % 0 76 Calculate Vertical Sum in Binary Tree Medium % 0 75 Print the Binary Tree in Vertical Order Path Medium % 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 69 Convert Sorted Singly Linked List to Balanced Binary Search Tree Medium % 1 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 63 Print Right View of Binary Tree Medium % 0 62 In a Binary Tree, Check if Two nodes has the same parent or are siblings Medium % 0 61 Determine If Two Nodes are Cousins Medium % 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 56 Sort an Array - odd numbers appear first in ascending order followed by the even numbers in descending order. Medium % 0 55 Print Nodes Between Two Levels in Binary Tree Medium % 0 54 Maximum Width of a Binary Tree Medium % 0 53 Count occurrences of a number in a sorted array Medium % 0 50 Find the first repeated element in an array by its index Medium % 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 46 Check if One Binary Tree is a Subtree of Another Medium % 0 45 Print a path from Root to Node in Binary Tree Medium % 0 44 Inorder Successor in Binary Tree Medium % 0 41 Sorted Array to Binary Search Tree of Minimal Height Medium % 1 39 Level Order Traversal, Print each level in separate line Medium % 0 38 Determining Binary Tree Balance Medium % 0 37 Get the Height of a Node in a Binary Tree Medium % 0 35 Adding Two Numbers with Linked Lists Medium % 0 34 Add two numbers represented by a linked list, Numbers are Stored in REVERSE order Medium % 0 33 Reverse the binary representation of a number. Medium % 1 31 Reverse a Linked List Using Recursion Medium % 0 Find Nodes X Levels Up from Leaf Nodes in a Tree Find Nodes at Distance X from Root in a Tree Root-to-Node Distance in Binary Tree: How to Find Calculate Vertical Sum in Binary Tree Print the Binary Tree in Vertical Order Path 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 Convert Sorted Singly Linked List to Balanced Binary Search 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 Print Right View of Binary Tree In a Binary Tree, Check if Two nodes has the same parent or are siblings Determine If Two Nodes are Cousins Print All Root-to-Leaf Paths in a Binary Tree Sort an Array According to the Order Defined by Another Array Sort an Array - odd numbers appear first in ascending order followed by the even numbers in descending order. Print Nodes Between Two Levels in Binary Tree Maximum Width of a Binary Tree Count occurrences of a number in a sorted array Find the first repeated element in an array by its index Find the Unreachable Minimum in Array Subsets Determining Whether a Given Binary Tree is a Binary Search Tree (BST) Check if One Binary Tree is a Subtree of Another Print a path from Root to Node in Binary Tree Inorder Successor in Binary Tree Sorted Array to Binary Search Tree of Minimal Height Level Order Traversal, Print each level in separate line Determining Binary Tree Balance Get the Height of a Node in a Binary Tree Adding Two Numbers with Linked Lists Add two numbers represented by a linked list, Numbers are Stored in REVERSE order Reverse the binary representation of a number. Reverse a Linked List Using Recursion 1 2 3 4 5 6 7
