Search for a command to run...
Series
In this series, I will explain Leetcode DP Questions with their solutions. We will start with Knapsack type DP Problems - 0/1 knapsack and Unbounded Knapsack and then go on to LCS type problems.
Problem Link - https://leetcode.com/problems/house-robber/ Problem Statement : You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each o...
The below is a very famous DP problem. You are climbing a staircase that has n steps. You can take the steps either 1 or 2 at a time. Calculate how many distinct ways you can climb to the top of the staircase. Example: for n=1, output = 1 for n=2, ou...
Problem Link - https://leetcode.com/problems/combination-sum-iv/description/ This DP Problem comes under Unbounded knapsack technique, where we are trying to get a certain sum with given numbers, and we can take any number as many times as we want. B...
