Dynamic Programming

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

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.

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.

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.

An integer array is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.

Given an n x n grid containing only values 0 and 1, where 0 represents water and 1 represents land, find a water cell such that its distance to the nearest land cell is maximized,...

Suppose you have n integers labeled 1 through n.

You are given an integer array values where values[i] represents the value of the ith sightseeing spot.

You are the manager of a basketball team.

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 array of unique integers, arr, where each integer arr[i] is strictly greater than 1.

Given an integer array arr, return the number of distinct bitwise ORs of all the non-empty subarrays of arr.

In the "100 game" two players take turns adding, to a running total, any integer from 1 to 10.

We stack glasses in a pyramid, where the first row has 1 glass, the second row has 2 glasses, and so on until the 100th row.

There are n cities connected by some number of flights.

You are given an array nums of length n and an integer m.

You are given a 0-indexed integer array nums.

You would like to make dessert and are preparing to buy the ingredients.

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 three integers x, y, and z.

You are given an array nums.

There are n soldiers standing in a line.

Alice is texting Bob using her phone.

There is a street with n * 2 plots, where there are n plots on each side of the street.

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

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

You are given a 2D integer array grid with size m x n.

Given an integer n, return the number of strings of length n that consist only of vowels (a, e, i, o, u) and are lexicographically sorted.

Given an m x n binary matrix mat, return the number of submatrices that have all ones.

Given two strings s and t, find the number of ways you can choose a non-empty substring of s and replace a single character by a different character such that the resulting...

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

Given the integers zero, one, low, and high, we can construct a string by starting with an empty string, and then at each step perform either of the following: This can be...

You have intercepted a secret message encoded as a string of numbers.

You are given a 0-indexed array words containing n strings.

You are given an integer array nums.

Given two strings word1 and word2, return the minimum number of steps required to make word1 and word2 the same.

Given a string expression of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators.

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

You have two types of tiles: a 2 x 1 domino shape and a tromino shape.

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

You are given two identical eggs and you have access to a building with n floors labeled from 1 to n.

You are given a 0-indexed string s and a dictionary of words dictionary.

You are given an integer array cookies, where cookies[i] denotes the number of cookies in the ith bag.

You are given an array books where books[i] = [thicknessi, heighti] indicates the thickness and height of the ith book.

You are given a 0-indexed integer array nums of size n and a positive integer k.

You are given 3 positive integers zero, one, and limit.

You and a gang of thieves are planning on robbing a bank.

You are given a string word.

You are given a string source of size n, a string pattern that is a subsequence of source, and a sorted integer array targetIndices that contains distinct numbers in the range [0,...

You are given an integer array nums.

There are n cities numbered from 0 to n-1.

You are given two strings word1 and word2.

You are given an integer array nums and a non-negative integer k.

A subsequence sub of nums with length x is called valid if it satisfies: Return the length of the longest valid subsequence of nums.

A subsequence sub of nums with length x is called valid if it satisfies:

You are given a string s, a string chars of distinct characters and an integer array vals of the same length as chars.

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

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

There are n rooms you need to visit, labeled from 0 to n - 1.

A binary string is monotone increasing if it consists of some number of 0's (possibly none), followed by some number of 1's (also possibly none).

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

Given an integer array nums, return the maximum possible sum of elements of the array such that it is divisible by three.

We are playing the Guessing Game.

You are a professional robber planning to rob houses along a street.

You are a professional robber planning to rob houses along a street.

There are several consecutive houses along a street, each of which has some money inside.

Given an integer n, break it into the sum of k positive integers, where k >= 2, and maximize the product of those integers.

Given a positive integer n, you can apply one of the following operations: Return the minimum number of operations needed for n to become 1.

Given strings s1, s2, and s3, find whether s3 is formed by an interleaving of s1 and s2.

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.

You are given an integer array nums.

You are given a 0-indexed array of integers nums of length n.

You are given a 0-indexed integer array nums and an integer k.

You are given a 0-indexed binary string s and two integers minJump and maxJump.

Given an integer array arr and an integer k, modify the array by repeating it k times.

The chess knight has a unique movement, it may move two squares vertically and one square horizontally, or two squares horizontally and one square vertically (with both forming...

On an n x n chessboard, a knight starts at the cell (row, column) and attempts to make exactly k moves.

Given a 2D grid of 0s and 1s, return the number of elements in the largest square subgrid that has all 1s on its border, or 0 if such a subgrid doesn't exist in the grid.

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 are given an integer n.

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

You are given an array of integers stones where stones[i] is the weight of the ith stone.

A sequence x1, x2, ..., xn is Fibonacci-like if: Given a strictly increasing array arr of positive integers forming a sequence, return the length of the longest Fibonacci-like...

You are given a 0-indexed array of integers nums, and an integer target.

Given an array nums of integers, return the length of the longest arithmetic subsequence in nums.

Given an integer array arr and an integer difference, return the length of the longest subsequence in arr which is an arithmetic sequence such that the difference between adjacent...

You are given a binary string s and a positive integer k.

Given two strings text1 and text2, return the length of their longest common subsequence.

You are given a string s consisting of lowercase letters and an integer k.

Given an integer array nums, return the length of the longest strictly increasing subsequence.

You may recall that an array arr is a mountain array if and only if: Given an integer array arr, return the length of the longest subarray, which is a mountain.

You are given two 0-indexed integer arrays nums1 and nums2 of length n.

You are given two strings, s and t.

Given a string s, find the longest palindromic subsequence's length in s.

You are given a string s and an integer k.

Given a string s, return the longest palindromic substring in s.

You are given an integer array nums.

You are given an array of words where each word consists of lowercase English letters.

Given a binary array nums, you should delete one element from it.

You are given an array of integers nums.

Given an integer array arr, return the length of a maximum size turbulent subarray of arr.

You are given a string array words, and an array groups, both arrays having length n.

You are given an integer n representing the number of nodes in a perfect binary tree consisting of nodes numbered from 1 to n.

You are given an integer array matchsticks where matchsticks[i] is the length of the ith matchstick.

Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.

You are given an integer n representing the number of houses on a number line, numbered from 0 to n - 1.

You are given an integer array nums with length n.

You are given an integer array nums.

The alternating sum of a 0-indexed array is defined as the sum of the elements at even indices minus the sum of the elements at odd indices.

You are given an m x n grid.

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

There is a survey that consists of n questions where each question's answer is either 0 (no) or 1 (yes).

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

There are n points on a road you are driving your taxi on.

You are given two integer arrays energyDrinkA and energyDrinkB of the same length n by a futuristic sports scientist.

You are given an array nums of length n.

You are given an array of n pairs pairs where pairs[i] = [lefti, righti] and lefti < righti.

Given two integer arrays nums1 and nums2, return the maximum length of a subarray that appears in both arrays.

Given an array of integers nums, find the maximum length of a subarray where the product of all its elements is positive.

You are given an integer array a of size 4 and another integer array b of size at least 4.

You are given a m x n matrix grid.

You are given a 0-indexed array nums of n integers and an integer target.

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

Given an array of integers called nums, you can perform any of the following operation while nums contains at least 2 elements: The score of the operation is the sum of the...

You are given an m x n integer matrix points (0-indexed).

You are given an integer k and an integer x.

You are given two integers, n and k, along with two 2D integer arrays, stayScore and travelScore.

Given a string s, find two disjoint palindromic subsequences of s such that the product of their lengths is maximized.

Given an integer array nums, find a subarray that has the largest product, and return the product.

There is an undirected tree with n nodes labeled from 0 to n - 1, and rooted at node 0.

You are given a 0-indexed integer array nums representing the score of students in an exam.

Find the contiguous subarray with the largest sum.

Given an array of integers, return the maximum sum for a non-empty subarray (contiguous elements) with at most one element deletion.

Given a circular integer array nums of length n, return the maximum possible sum of a non-empty subarray of nums.

Given an integer array nums and two integers firstLen and secondLen, return the maximum sum of elements in two non-overlapping subarrays with lengths firstLen and secondLen.

A magician has various spells.

You are given an integer array rewardValues of length n, representing the values of rewards.

You are given an integer n and a Directed Acyclic Graph (DAG) with n nodes labeled from 0 to n - 1.

You are given a 0-indexed array nums comprising of n non-negative integers.

You are given an m x n integer matrix mat and an integer target.

You are given a 0-indexed integer array nums and an integer p.

Given a string word to which you can insert letters "a", "b" or "c" anywhere and any number of times, return the minimum number of letters that must be inserted so that word...

You are given an integer array nums and three integers k, op1, and op2.

Given two strings s1 and s2, return the lowest ASCII sum of deleted characters to make two strings equal.

There is an m x n cake that needs to be cut into 1 x 1 pieces.

You have planned some train traveling one year in advance.

You are given two integers m and n representing the number of rows and columns of a grid, respectively.

You are given a 0-indexed binary string s of length n on which you can apply two types of operations: Return the minimum cost to make all characters of the string equal.

Given an array arr of positive integers, consider all binary trees such that: Among all possible binary trees considered, return the smallest possible sum of the values of each...

You are given a string s consisting only of characters 'a' and 'b'​​​​.

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

You are given a 0-indexed integer array nums having length n, and an integer k.

You are given an integer n and an undirected tree rooted at node 0 with n nodes numbered from 0 to n - 1.

A certain bug's home is on the x-axis at position x.

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 an 0-indexed integer array prices where prices[i] denotes the number of coins needed to purchase the (i + 1)th fruit.

You are given a binary string s.

You are given a 0-indexed string hamsters where hamsters[i] is either: You will add some number of food buckets at the empty indices in order to feed the hamsters.

You are given two positive integers x and y.

You are given a 2D matrix grid of size m x n.

You are given an array of strings words and a string target.

There are n tasks assigned to you.

You are given a binary array nums.