Top 20 Problems on Dynamic programming # Status Problem Level Completes Likes 1 Dynamic programming – Minimum Jumps to reach to end Hard % 0 2 Dynamic programming - Remove Boxes Problem Hard % 0 3 Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Medium % 1 4 Dynamic Programming - Edit Distance Problem Hard % 2 5 Dynamic Programming - Coin In a Line Game Problem Hard % 0 6 Dynamic Programming - Highway Billboard Problem Hard % 0 7 Dynamic Programming - Maximum Subarray Problem Medium % 0 8 Dynamic Programming — Longest Palindromic Subsequence Hard % 1 9 Dynamic Programming - Maximum Product Cutting Problem. Medium % 1 10 Dynamic Programming - Longest Common Substring Medium % 0 11 Dynamic Programming - Longest Common Subsequence Medium % 0 12 Dynamic Programming - Rod Cutting Problem Medium % 1 13 Dynamic Programming - Coin Change Problem Medium % 1 14 Dynamic Programming - Minimum Cost Path Problem Medium % 1 15 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 1 16 Dynamic Programming - Subset Sum Problem Hard % 0 17 Dynamic Programming - Longest Increasing Subsequence Medium % 1 18 Dynamic Programming - Stairs Climbing Puzzle Beginner % 1 19 Dynamic Programming - Minimum Coin Change Problem Medium % 1 20 Introduction To Dynamic Programming - Fibonacci Series Beginner % 1 Dynamic programming – Minimum Jumps to reach to end Dynamic programming - Remove Boxes Problem 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 - Highway Billboard Problem Dynamic Programming - Maximum Subarray Problem Dynamic Programming — Longest Palindromic Subsequence Dynamic Programming - Maximum Product Cutting Problem. 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 Dynamic Programming - Subset Sum Problem Dynamic Programming - Longest Increasing Subsequence Dynamic Programming - Stairs Climbing Puzzle Dynamic Programming - Minimum Coin Change Problem Introduction To Dynamic Programming - Fibonacci Series 1