Search for a command to run...
Articles tagged with #dynamic-programming
Problem Statement: A top secret message containing uppercase letters from 'A' to 'Z' has been encoded as numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 You are an FBI agent and you need to determine the total number of ways tha...
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...
