Problems # Status Problem Level Completes Likes 1 Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1. Medium % 0 2 Minimum No of operations required to convert a given number to 1 - Integer Replacement Problem. Medium % 0 3 Dynamic Programming - Egg Dropping Problem Hard % 0 4 Dynamic programming – Minimum Jumps to reach to end Hard % 0 5 Dynamic programming – Printer Problem Hard % 0 6 Dynamic programming - Remove Boxes Problem Hard % 0 7 Stock Single Sell Problem - O(n) Solution Hard % 1 8 Maximum difference between two elements where larger element appears after the smaller element Medium % 0 9 Find longest Snake sequence in a given matrix Medium % 0 10 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 0 11 Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Medium % 0 12 Dynamic Programming - Edit Distance Problem Hard % 1 13 Dynamic Programming - Coin In a Line Game Problem Hard % 0 14 Dynamic Programming - Box Stacking Problem Hard % 0 15 Dynamic Programming - Highway Billboard Problem Hard % 0 16 Dynamic Programming - Maximum Subarray Problem Medium % 0 17 Dynamic Programming — Longest Palindromic Subsequence Hard % 0 18 Dynamic Programming - Maximum Product Cutting Problem. Medium % 0 19 Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number Hard % 0 20 Dynamic Programming - Longest Common Substring Medium % 0 21 Dynamic Programming - Longest Common Subsequence Medium % 0 22 Dynamic Programming - Rod Cutting Problem Medium % 0 23 Dynamic Programming - Coin Change Problem Medium % 0 24 Dynamic Programming - Minimum Cost Path Problem Medium % 0 25 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 0 26 The Word Break Problem Hard % 0 27 Dynamic Programming - Longest Increasing Subsequence Medium % 0 28 Dynamic Programming - Stairs Climbing Puzzle Beginner % 0 29 Dynamic Programming - Minimum Coin Change Problem Medium % 0 30 Introduction To Dynamic Programming - Fibonacci Series Beginner % 0 31 Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths Medium % 0 Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1. Minimum No of operations required to convert a given number to 1 - Integer Replacement Problem. Dynamic Programming - Egg Dropping Problem Dynamic programming – Minimum Jumps to reach to end Dynamic programming – Printer Problem Dynamic programming - Remove Boxes Problem Stock Single Sell Problem - O(n) Solution Maximum difference between two elements where larger element appears after the smaller element Find longest Snake sequence in a given matrix Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Dynamic Programming - Edit Distance Problem Dynamic Programming - Coin In a Line Game Problem Dynamic Programming - Box Stacking Problem Dynamic Programming - Highway Billboard Problem Dynamic Programming - Maximum Subarray Problem Dynamic Programming — Longest Palindromic Subsequence Dynamic Programming - Maximum Product Cutting Problem. Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number 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 Dynamic Programming - Maximum size square sub-matrix with all 1s The Word Break Problem Dynamic Programming - Longest Increasing Subsequence Dynamic Programming - Stairs Climbing Puzzle Dynamic Programming - Minimum Coin Change Problem Introduction To Dynamic Programming - Fibonacci Series Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths 1