# Status Problem Level Completes Likes 141 All N Length Strings from Given String of Length K Medium % 0 142 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 1 143 Dynamic Programming - Longest Increasing Subsequence Medium % 1 144 Dynamic Programming - Minimum Coin Change Problem Medium % 1 145 Find the Deepest Left Node in a Binary Tree. Medium % 0 146 Rearrange the Array of Given Range N, such that A[i]=i Medium % 0 147 Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number Medium % 0 148 Do the Reverse Level Order Traversal in a binary tree Medium % 0 149 Find the Deepest Node in a Binary Tree. Medium % 1 150 Find the Height of a tree without using Recursion Medium % 0 151 Find All the Well Ordered Permutations of a Given String. Medium % 0 152 Find the Increasing Triplet Sub-sequence in an array Medium % 0 153 Track the Maximum Element in a Stack. Medium % 0 154 Counting Sort Medium % 0 155 Generate All Strings of n bits. Medium % 1 156 Implement Queue Using Stacks Medium % 0 157 Alternate Splitting of a given Linked List Medium % 0 158 Reverse The Doubly Linked List Medium % 0 159 Swap Kth Node from the front with the Kth Node from the End Medium % 0 160 Print the Bottom View of the Binary Tree. Medium % 0 161 Merge Sort in a Linked list Medium % 0 162 Merge a Linked list into another Linked List at Alternate Positions. Medium % 0 163 Print The Top View of a Binary Tree Medium % 0 164 Check if Array Contains All Elements Of Some Given Range Medium % 0 165 Find the subarray with sum to a Given Value. Medium % 0 166 In an Array, find the Smallest Subarray with Sum Greater than the Given Value Medium % 0 167 Find Kth Smallest or Largest element in an Array. Medium % 0 168 Given an array arrA[], find the maximum j – i such that arr[j] > arr[i]. Medium % 0 169 Search an Element in a Rotated Sorted Array Medium % 0 170 Print All The Nodes Which are X distance from the Leaf Nodes Medium % 0 171 Print All The Nodes Which are X distance from the Root Medium % 0 172 Find The Distance From Root To Given Node of a Binary Tree. Medium % 0 173 Print the Vertical Sum in binary Tree . Medium % 0 174 Print the Binary Tree in Vertical Order Path. Medium % 0 175 Lowest Common Ancestor in a Binary Search Tree. Medium % 0 All N Length Strings from Given String of Length K Dynamic Programming - Maximum size square sub-matrix with all 1s Dynamic Programming - Longest Increasing Subsequence Dynamic Programming - Minimum Coin Change Problem Find the Deepest Left Node in a Binary Tree. Rearrange the Array of Given Range N, such that A[i]=i Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number Do the Reverse Level Order Traversal in a binary tree Find the Deepest Node in a Binary Tree. Find the Height of a tree without using Recursion Find All the Well Ordered Permutations of a Given String. Find the Increasing Triplet Sub-sequence in an array Track the Maximum Element in a Stack. Counting Sort Generate All Strings of n bits. Implement Queue Using Stacks Alternate Splitting of a given Linked List Reverse The Doubly Linked List Swap Kth Node from the front with the Kth Node from the End Print the Bottom View of the Binary Tree. Merge Sort in a Linked list Merge a Linked list into another Linked List at Alternate Positions. Print The Top View of a Binary Tree Check if Array Contains All Elements Of Some Given Range Find the subarray with sum to a Given Value. In an Array, find the Smallest Subarray with Sum Greater than the Given Value Find Kth Smallest or Largest element in an Array. Given an array arrA[], find the maximum j – i such that arr[j] > arr[i]. Search an Element in a Rotated Sorted Array 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 From Root To Given Node of a Binary Tree. Print the Vertical Sum in binary Tree . Print the Binary Tree in Vertical Order Path. Lowest Common Ancestor in a Binary Search Tree. 1 2 3 4 5 6 7
