Dynamic Programming Mastery

You are climbing a staircase.

Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.

Alice and Bob take turns playing a game, with Alice starting first.

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1.

Given two strings s and t, return true if s is a subsequence of t, or false otherwise.

You are given a string array words and a binary array groups both of length n.

For a string sequence, a string word is k-repeating if word concatenated k times is a substring of sequence.

You are given an integer array cost where cost[i] is the cost of ith step on a staircase.

The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0.

There is only one character 'A' on the screen of a notepad.

n passengers board an airplane with exactly n seats.

You are given two 0-indexed binary strings s1 and s2, both of length n, and a positive integer x.

Given an integer numRows, return the first numRows of Pascal's triangle.

Given an integer rowIndex, return the rowIndexth (0-indexed) row of the Pascal's triangle.

Given an m x n binary matrix mat, return the distance of the nearest 0 for each cell.

You are given a 0-indexed m x n binary matrix grid.

You are given an m x n grid.

You are given an m x n matrix grid consisting of positive integers.

You are given a m x n matrix grid.

You are given a 0-indexed m x n matrix grid consisting of positive integers.

You are given a 0-indexed 2D integer matrix grid of size 3 * 3, representing the number of stones in each cell.

You are given a 0-indexed m x n integer matrix grid consisting of distinct integers from 0 to m * n - 1.

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

Given a triangle array, return the minimum path sum from top to bottom.

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

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

Given an array of distinct integers nums and a target integer target, return the number of possible combinations that add up to target.

You are given a positive integer 0-indexed array nums.

You are given an array of integers arr and an integer target.

You are given a 1-indexed integer array numWays, where numWays[i] represents the number of ways to select a total amount i using an infinite supply of some fixed coin denominations.

Given a set of distinct positive integers nums, return the largest subset answer such that every pair (answer[i], answer[j]) of elements in this subset satisfies: If there are...

You have n dice, and each dice has k faces numbered from 1 to k.

Given an integer array nums, return true if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or false otherwise.

Given an integer array nums and an integer k, return true if it is possible to divide this array into k non-empty subsets whose sums are all equal.

You are given an integer array nums and an integer target.

You are given an array nums of positive integers and a positive integer k.

You are given a 0-indexed integer array nums.

You are given an integer array nums and an integer k.

Given a string s, you need to partition it into one or more balanced substrings.

Given a string s, partition s such that every substring of the partition is a palindrome.

Given an integer array arr, partition the array into (contiguous) subarrays of length at most k.

You are given an integer array nums and an integer k.

Given a binary string s, partition the string into one or more substrings such that each substring is beautiful.

You are given a string s consisting of digits from 1 to 9 and an integer k.

You are given n balloons, indexed from 0 to n - 1.

You are given a string s and an integer k.

There are n piles of stones arranged in a row.

You are given a string s that consists of the digits '1' to '9' and two integers k and minLength.

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 given an integer array prices where prices[i] is the price of a stock in dollars on the ith day, and an integer k.

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

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

Given an integer n, return the count of all numbers with unique digits, x, where 0 <= x < 10n.

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

You are given an even integer n representing the number of houses arranged in a straight line, and a 2D array cost of size n x 3, where cost[i][j] represents the cost of painting...

An integer x is a good if after rotating each digit individually by 180 degrees, we get a valid number that is different from x.

Given two integers num and k, consider a set of positive integers with the following properties: Return the minimum possible size of such a set, or -1 if no such set exists.

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, and an integer k.