# Status Problem video Level Completes Likes 101 Merge a Linked list into another Linked List at Alternate Positions. Medium % 0 99 Construct a binary tree from given Inorder and Level Order Traversal Hard % 0 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 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 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 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 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 45 Print a path from Root to Node in Binary Tree 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 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 39 Level Order Traversal, Print each level in separate line. Medium % 0 38 Find whether a Given Binary Tree is Balanced? Medium % 0 36 Find the Maximum Depth OR Height of a Binary Tree Beginner % 1 35 Add two numbers represented by a linked list, Numbers are Stored in FORWARD order Medium % 0 34 Add two numbers represented by a linked list, Numbers are Stored in REVERSE order Medium % 0 31 Reverse a Linked List - Part 2 Medium % 0 30 Swap Every Kth Node in a LinkedList Medium % 0 29 Delete a Node in the Middle of a linked list, Given only access to that Node Beginner % 0 28 Find the n'th Node from the end of a given Linked List Beginner % 0 27 Remove Duplicates from an Unsorted Linked list Beginner % 0 Merge a Linked list into another Linked List at Alternate Positions. Construct a binary tree from given Inorder and Level Order Traversal 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. 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. Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space Find intersection between Two Sorted Arrays. 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. 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. Print a path from Root to Node in Binary Tree 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. Level Order Traversal, Print each level in separate line. Find whether a Given Binary Tree is Balanced? Find the Maximum Depth OR Height of a Binary Tree Add two numbers represented by a linked list, Numbers are Stored in FORWARD order Add two numbers represented by a linked list, Numbers are Stored in REVERSE order Reverse a Linked List - Part 2 Swap Every Kth Node in a LinkedList Delete a Node in the Middle of a linked list, Given only access to that Node Find the n'th Node from the end of a given Linked List Remove Duplicates from an Unsorted Linked list 1 2 3 4 5 6 7 8 9
