Word Break (LeetCode 139)
The problem You get a string and a list of words . Return if can be cut into…
Tag
#dynamic-programming
42 posts
Unique Paths II (LeetCode 63)
The problem You get an grid of 0s and 1s, where is an obstacle. A robot starts…
Unique Paths (LeetCode 62)
The problem A robot starts at the top-left corner of an grid and wants to reach…
Student Attendance Record II (LeetCode 552)
The problem An attendance record is a string of (present), (absent) and (late…
Stone Game (LeetCode 877)
The problem Piles of stones sit in a row. Alice and Bob take turns, Alice first…
Regular Expression Matching (LeetCode 10)
The problem Implement matching for a pattern against a string , where: matches…
Partition to K Equal Sum Subsets (LeetCode 698)
The problem You get an array of positive integers and a number . Decide whether…
Partition Equal Subset Sum (LeetCode 416)
The problem Given an array of positive integers, return if it can be split…
Partition Array for Maximum Sum (LeetCode 1043)
The problem You get an integer array and an integer . Cut the array into…
Minimum Path Sum (LeetCode 64)
The problem You get an grid of non-negative numbers. Walk from the top-left…
Minimum Cost to Cut a Stick (LeetCode 1547)
The problem A wooden stick has length , with positions to . You must make every…
Min Cost Climbing Stairs (LeetCode 746)
The problem You get an array , where is the price of stepping off step . You…
Maximum Subarray (LeetCode 53)
The problem Given an integer array (at least one element, values can be…
Maximum Product Subarray (LeetCode 152)
The problem Given an integer array (at least one element; values may be…
Maximal Square (LeetCode 221)
The problem You get a matrix of characters and . Find the largest square made…
Longest Palindromic Subsequence (LeetCode 516)
The problem Given a string (at least one character), return the length of its…
Longest Palindromic Substring (LeetCode 5)
The problem Given a string , return its longest contiguous substring that reads…
Maximum Profit in Job Scheduling (LeetCode 1235)
The problem You get jobs. Job runs from to and pays . Choose a set of jobs…
Longest Increasing Subsequence (LeetCode 300)
The problem Given an integer array , return the length of the longest strictly…
Longest Common Subsequence (LeetCode 1143)
The problem Given two strings and , return the length of their longest common…
Jump Game (LeetCode 55)
The problem You start at index 0 of an array of non-negative integers. is the…
Interleaving String (LeetCode 97)
The problem You get three strings , and . Return if can be formed by…
House Robber III (LeetCode 337)
The problem Houses form a binary tree. Each node has a value (the money inside…
House Robber (LeetCode 198)
The problem Houses stand in a row and is the money in house (all values non…
House Robber II (LeetCode 213)
The problem Same rules as House Robber: is the money in house , and you cannot…
Edit Distance (LeetCode 72)
The problem Given two words and , return the minimum number of single-character…
Distinct Subsequences (LeetCode 115)
The problem Given strings and , return the number of distinct ways to pick…
Dungeon Game (LeetCode 174)
The problem A knight starts at the top-left of a grid and must reach the…
Decode Ways (LeetCode 91)
The problem Letters are encoded as numbers: , , …, . Given a string of digits…
Count Vowels Permutation (LeetCode 1220)
The problem Count the strings of length built from the vowels that follow…
Counting Bits (LeetCode 338)
The problem Given an integer , return a list of length where is the number of…
Coin Change II (LeetCode 518)
The problem You get an and a list of coin denominations (unlimited supply of…
Climbing Stairs (LeetCode 70)
The problem You are at the bottom of a staircase with steps. Each move climbs…
Coin Change (LeetCode 322)
The problem You get a list of coin denominations (unlimited supply of each) and…
Burst Balloons (LeetCode 312)
The problem Balloons in a row each carry a number. Bursting balloon earns…
Coding Interview Patterns — Crack the Coding Round
There are thousands of coding-interview questions but only about eighteen…
Advanced Dynamic Programming
By now you can define a state and a recurrence (Lessons 17–18). The DP problems…
Advanced DP — Practice Problems
Ten problems that drill bitmask, interval, and tree DP from Lesson 24. The work…
Dynamic Programming II (2-D) — Practice Problems
Twelve problems that drill 2-D dynamic programming from Lesson 18 — two-sequence…
Dynamic Programming II — 2-D
The final pattern. When a problem involves two sequences or a grid, one index…
Dynamic Programming I — 1-D
Dynamic programming scares people more than anything else — but it’s a single…
Dynamic Programming I (1-D) — Practice Problems
Thirteen problems that drill 1-D dynamic programming from Lesson 17. The hard 9…