Blind 75 Dynamic Programming Questions

A staircase has n ≥ 1 steps. You can climb one or two steps at a time. Count the different ordered sequences of moves that reach the top exactly.

Each house along a street contains a nonnegative amount. Find the maximum total obtainable without choosing two neighboring houses. Choosing none is allowed.

Houses form a circle and have nonnegative amounts. Maximize the sum of chosen houses without choosing any neighbors, including the first and last together.

Return a longest contiguous substring that reads the same forward and backward. If several have the same maximum length, any is acceptable.

Count all nonempty contiguous palindromic substrings. Substrings at different positions count separately even when their text is identical.

A digit string encodes letters with 1 → A through 26 → Z. Count valid decodings. A zero cannot stand alone, and codes cannot begin with zero. The input is nonempty.

Given positive coin denominations and a nonnegative amount, find the fewest coins needed to make that amount with unlimited copies. Return −1 when it is impossible.

Find the largest product of any nonempty contiguous subarray of a nonempty integer array. Values may be positive, negative, or zero.

Decide whether a string can be split into one or more words from a dictionary of nonempty strings. Dictionary words can be reused. Treat an empty input as segmentable.

Return the length of the longest strictly increasing subsequence of an integer array. Chosen elements keep their order but need not be adjacent.

Count paths from the top-left to the bottom-right of an m×n grid, with m,n ≥ 1. Each move goes one cell right or down. There are no obstacles.

Find the length of the longest sequence obtainable from each of two strings by deleting characters without reordering those kept.