# Status Problem video Level Completes Likes 549 Dynamic Programming - Minimum Cost for Climbing Stairs Medium % 0 548 Minimum Number of Halls Required for Lecture Scheduling Hard % 1 428 Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1. Medium % 0 407 Integer Replacement Problem Medium % 0 251 Dynamic Programming - Egg Dropping Problem Hard % 0 246 Dynamic programming – Minimum Jumps to reach to end Hard % 0 245 Dynamic programming – Printer Problem | Leetcode Hard % 0 244 Dynamic programming - Remove Boxes Problem | leetcode Hard % 0 223 Stock Single Sell Problem - Dynamic Programming - O(n) Medium % 2 221 Identifying Maximum Gain from Sequential Elements Medium % 0 209 Find longest Snake sequence in a given matrix Medium % 1 208 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 1 207 Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Medium % 1 204 Dynamic Programming - Edit Distance Problem Hard % 2 203 Dynamic Programming - Coin In a Line Game Problem Hard % 0 202 Dynamic Programming - Box Stacking Problem Hard % 0 200 Dynamic Programming - Highway Billboard Problem Hard % 0 199 Dynamic Programming - Maximum Subarray Problem Medium % 0 175 Dynamic Programming — Longest Palindromic Subsequence Hard % 1 174 Dynamic Programming - Maximum Product Cutting Problem Medium % 1 Dynamic Programming - Minimum Cost for Climbing Stairs Minimum Number of Halls Required for Lecture Scheduling Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1. Integer Replacement Problem Dynamic Programming - Egg Dropping Problem Dynamic programming – Minimum Jumps to reach to end Dynamic programming – Printer Problem | Leetcode Dynamic programming - Remove Boxes Problem | leetcode Stock Single Sell Problem - Dynamic Programming - O(n) Identifying Maximum Gain from Sequential Elements 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 1 2
