LeetCode 956: Tallest Billboard
A clear explanation of solving Tallest Billboard using dynamic programming over height differences.
Tag
Knapsack
5 notes
LeetCode 879: Profitable Schemes
A clear explanation of counting profitable crime schemes using 0/1 knapsack dynamic programming with members and profit states.
LeetCode 494: Target Sum
A clear explanation of counting sign assignments that reach a target using recursion first, then subset-sum dynamic programming.
LeetCode 474: Ones and Zeroes
A clear explanation of solving the largest subset problem as a two-dimensional 0/1 knapsack over zero and one counts.
LeetCode 416: Partition Equal Subset Sum
A clear explanation of deciding whether an array can be split into two equal-sum subsets using 0/1 knapsack dynamic programming.