# Status Problem video Level Completes Likes 172 Dynamic Programming - Longest Common Substring Medium % 0 171 Dynamic Programming - Longest Common Subsequence Medium % 0 170 Dynamic Programming - Rod Cutting Problem Medium % 1 169 Dynamic Programming - Coin Change Problem Medium % 1 168 Dynamic Programming - Minimum Cost Path Problem Medium % 1 167 Generate Well Ordered Passwords of a Given Length K Medium % 0 166 All N Length Strings from Given String of Length K Medium % 0 163 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 1 160 Dynamic Programming - Longest Increasing Subsequence Medium % 1 145 Dynamic Programming - Minimum Coin Change Problem Medium % 1 142 Locate the Farthest Left Node on the Bottom Level Medium % 0 140 Rearrange Array Elements (A[i] = i) | In-place Approach Medium % 0 135 Find Paths with Sum in Binary Tree Medium % 0 133 Reverse Level Order Traversal of Binary Trees Medium % 0 132 Find the Deepest Node in a Binary Tree Medium % 1 131 Find the Height of a tree without using Recursion Medium % 0 126 Generate All Permutations of a String (Well-Ordered) Medium % 0 125 Find the Increasing Triplet Sub-sequence in an array Medium % 0 117 Stack with Max Tracking: Find the Largest Element (Optimized) Medium % 1 116 Generate All Balanced Parentheses Combinations (N Pairs) Medium % 1 Dynamic Programming - Longest Common Substring Dynamic Programming - Longest Common Subsequence Dynamic Programming - Rod Cutting Problem Dynamic Programming - Coin Change Problem Dynamic Programming - Minimum Cost Path Problem Generate Well Ordered Passwords of a Given Length K 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 Locate the Farthest Left Node on the Bottom Level Rearrange Array Elements (A[i] = i) | In-place Approach Find Paths with Sum in Binary Tree Reverse Level Order Traversal of Binary Trees Find the Deepest Node in a Binary Tree Find the Height of a tree without using Recursion Generate All Permutations of a String (Well-Ordered) Find the Increasing Triplet Sub-sequence in an array Stack with Max Tracking: Find the Largest Element (Optimized) Generate All Balanced Parentheses Combinations (N Pairs) 1 2 3 4 5 6 7 8 9 10 11 12
