# Status Problem Level Completes Likes 36 Find local minimum or local maximum in O(1). Medium % 0 37 Stock Single Sell Problem - O(n) Solution Hard % 2 38 Maximum difference between two elements where larger element appears after the smaller element Medium % 0 39 Single Threaded Binary Tree Complete Implementation Hard % 0 40 Print All Possible Subsets with Sum equal to a given Number Hard % 0 41 The Word Break Problem Hard % 0 42 Backtracking - Knight's Tour Problem Hard % 0 43 Backtracking - Search a Word In a Matrix Hard % 0 44 Backtracking - N Queens Problem - Better Solution Hard % 0 45 Backtracking - N Queens Problem Hard % 0 46 Backtracking - Rat In A Maze Puzzle Hard % 0 47 Dynamic Programming - Stairs Climbing Puzzle Beginner % 1 48 Dynamic Programming - Minimum Coin Change Problem Medium % 1 49 Merge K Sorted Arrays Hard % 0 50 Diameter Of a Binary Tree Hard % 1 51 Find the Height of a tree without using Recursion Medium % 0 52 Print All the Subsets of a Given Set (Power Set) Hard % 1 53 Print All Combinations of subset of size K from Given Array Hard % 0 54 Print All Possible Valid Combinations Of Parenthesis of Given 'N' Hard % 1 55 Implement Queue Using Stacks Medium % 0 56 Merge Sort in a Linked list Medium % 0 57 Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Hard % 0 58 Construct Binary Search Tree from a given Preorder Traversal using Recursion Hard % 0 59 In an Array, find the Smallest Subarray with Sum Greater than the Given Value Medium % 0 60 Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number. Hard % 0 61 Print All The Nodes Which are X distance from the Given Node Hard % 0 62 Print a path from Root to Node in Binary Tree Medium % 0 63 In a Binary Tree, Create Linked Lists of all the nodes at each depth. Hard % 0 64 Level Order Traversal, Print each level in separate line. Medium % 0 65 Find the Maximum Depth OR Height of a Binary Tree Beginner % 1 Find local minimum or local maximum in O(1). Stock Single Sell Problem - O(n) Solution Maximum difference between two elements where larger element appears after the smaller element Single Threaded Binary Tree Complete Implementation Print All Possible Subsets with Sum equal to a given Number The Word Break Problem Backtracking - Knight's Tour Problem Backtracking - Search a Word In a Matrix Backtracking - N Queens Problem - Better Solution Backtracking - N Queens Problem Backtracking - Rat In A Maze Puzzle Dynamic Programming - Stairs Climbing Puzzle Dynamic Programming - Minimum Coin Change Problem Merge K Sorted Arrays Diameter Of a Binary Tree Find the Height of a tree without using Recursion Print All the Subsets of a Given Set (Power Set) Print All Combinations of subset of size K from Given Array Print All Possible Valid Combinations Of Parenthesis of Given 'N' Implement Queue Using Stacks Merge Sort in a Linked list Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Construct Binary Search Tree from a given Preorder Traversal using Recursion In an Array, find the Smallest Subarray with Sum Greater than the Given Value 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 a path from Root to Node in Binary Tree In a Binary Tree, Create Linked Lists of all the nodes at each depth. Level Order Traversal, Print each level in separate line. Find the Maximum Depth OR Height of a Binary Tree 1 2
