# Status Problem video Level Completes Likes 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 66 Convert a Sorted Doubly Linked List to Balanced BST Medium % 1 53 Count occurrences of a number in a sorted array Medium % 0 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 40 In a Binary Tree, Create Linked Lists of all the nodes at each depth Hard % 0 39 Level Order Traversal, Print each level in separate line Medium % 0 15 Efficiently Rearrange Positive and Negative Numbers in Array on Each Side Hard % 0 14 Longest Shared Prefix Sequence in a String Medium % 0 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 Convert a Sorted Doubly Linked List to Balanced BST Count occurrences of a number in a sorted array Inorder Successor in Binary Tree Inorder Successor in Binary Search Tree without Using Parent link Inorder Successor in Binary Search Tree Using Parent link In a Binary Tree, Create Linked Lists of all the nodes at each depth Level Order Traversal, Print each level in separate line Efficiently Rearrange Positive and Negative Numbers in Array on Each Side Longest Shared Prefix Sequence in a String 1 2 3 4 5 6
