Problems # Status Problem Level Completes Likes 36 Dynamic Programming — Longest Palindromic Subsequence Hard % 0 37 Dynamic Programming - Longest Common Subsequence Medium % 0 38 Print All N Length Strings from Given Number K Hard % 0 39 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 0 40 The Word Break Problem Hard % 0 41 Dynamic Programming - Longest Increasing Subsequence Medium % 0 42 Backtracking - Search a Word In a Matrix Hard % 0 43 Dynamic Programming - Minimum Coin Change Problem Medium % 0 44 Find the Deepest Left Node in a Binary Tree. Medium % 0 45 Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number Medium % 0 46 Find the Deepest Node in a Binary Tree. Medium % 0 47 Track the Maximum Element in a Stack. Medium % 0 48 Print All Possible Valid Combinations Of Parenthesis of Given 'N' Hard % 0 49 Implement Queue Using Stacks Medium % 0 50 Alternate Splitting of a given Linked List Medium % 0 51 Merge Sort in a Linked list Medium % 0 52 In an Array, find the Smallest Subarray with Sum Greater than the Given Value Medium % 0 53 Given an array arrA[], find the maximum j – i such that arr[j] > arr[i]. Medium % 0 Dynamic Programming — Longest Palindromic Subsequence Dynamic Programming - Longest Common Subsequence Print All N Length Strings from Given Number K Dynamic Programming - Maximum size square sub-matrix with all 1s The Word Break Problem Dynamic Programming - Longest Increasing Subsequence Backtracking - Search a Word In a Matrix Dynamic Programming - Minimum Coin Change Problem Find the Deepest Left Node in a Binary Tree. Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number Find the Deepest Node in a Binary Tree. Track the Maximum Element in a Stack. Print All Possible Valid Combinations Of Parenthesis of Given 'N' Implement Queue Using Stacks Alternate Splitting of a given Linked List Merge Sort in a Linked list In an Array, find the Smallest Subarray with Sum Greater than the Given Value Given an array arrA[], find the maximum j – i such that arr[j] > arr[i]. 1 2
