#dynamic programming

Choose words with no shared letters to cover the most letters
CodingMediumMeta
▲ 00 solutions
Largest all-ones square and rectangle in a binary matrix
CodingMediumDatabricks
▲ 00 solutions
Build a target string from the fewest substrings of a source
CodingHardDatabricks
▲ 00 solutions
Maximum sum of non-adjacent houses, on a line, a circle and a tree
CodingMediumDatabricks
▲ 00 solutions
Longest subsequence with at most k value changes
CodingMediumSnowflake
▲ 01 solution
Subset sum to a target
CodingMediumUber
▲ 01 solution
Reachable sum with reusable values and a huge target
CodingHardGoogle
▲ 01 solution
Regex matcher with starred groups
CodingHardAmazon
▲ 01 solution
Group booking across properties in one neighborhood
CodingMediumAirbnb
▲ 01 solution
Best-scoring ski run through a trail map
CodingHardAirbnb
▲ 01 solution
Split parcels into the most balanced shipments
CodingMediumAmazon
▲ 01 solution
Maximum path sum between two leaves of a binary tree
CodingEasyGoogle
▲ 01 solution
Max flight distance with limited energy
CodingHardGoogle
▲ 01 solution
Longest subsequence of one string that is a substring of another
CodingMediumMicrosoft
▲ 01 solution
Limit tree height by deleting nodes
CodingMediumSnowflake
▲ 01 solution
Multi-tap keypad: every string a press sequence can spell
CodingMediumMicrosoftMeta
▲ 01 solution
Type a word on a grid keyboard with a jump limit
CodingMediumGoogle
▲ 01 solution
Max-score jumps with primes ending in 3
CodingHardUber
▲ 01 solution
Longest path in a DAG from an edge list
CodingHardAmazon
▲ 01 solution
Fill a layover with the fewest bookings
CodingMediumAirbnb
▲ 01 solution
Insert plus, times and parentheses to reach a target
CodingHardGoogleAmazon
▲ 01 solution
Factory network cost with stage-to-stage transport
CodingHardStripe
▲ 01 solution
Count colorings of a row of houses with fixed end colors
CodingHardGoogle
▲ 01 solution
Ball picking game: take one or two from the front
CodingHardGoogle
▲ 01 solution
Max-score grid descent with limited two-row jumps
CodingMediumOpenAI
▲ 01 solution
Distinct OR values of increasing subsequences
CodingMediumScale AI
▲ 01 solution
Minimum-cost encryption of a directory tree
CodingMediumDatabricks
▲ 01 solution