Dynamic Programming Problems

You are given an array prices where prices[i] is the price of a given stock on the ith day.

You are given an integer array prices where prices[i] is the price of a given stock on the ith day.

You are climbing a staircase. It takes n steps to reach the top.

You are given an integer array coins representing coins of different denominations and an integer amount representing a

Given two strings s and t, return the number of distinct subsequences of s which equals t.

Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.

Given N friends, each one can remain single or can be paired up with some other friend. Each friend can be paired only o

There is a frog 🐸 on the 1st step of an N stairs long staircase. The frog wants to reach the Nth stair. HEIGHT[i] is th

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, t

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. A

Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subseque

There are n stones and an array of heights and Geek is standing at stone 1 and can jump to one of the following: Stone i

Given an n x n array of integers matrix, return the minimum sum of any falling paththrough matrix.

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum

Ninja is planing this ‘N’ days-long training schedule. Each day, he can perform any one of these three activities. (Runn

You have n dice, and each dice has k faces numbered from 1 to k. Given three integers n, k, and target, return the numbe

Given an integer array nums, return true if you can partition the array into two subsets such that the sum of the elemen

Given a rod of length ‘N’ units. The rod can be cut into different sizes and each size has a cost associated with it. De

Given two strings str1 and str2, return the shortest string that has both str1and str2 as subsequences. If there are mul

You are given an array/list ‘ARR’ of ‘N’ positive integers and an integer ‘K’. Your task is to check if there exists a s

There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot t

Same question just with Obstacles in the grid.

Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '' where: