From 7f40f1d579b081834c8780248c839bb56a90d270 Mon Sep 17 00:00:00 2001 From: Tri Truong Date: Tue, 5 Oct 2021 16:41:05 -0500 Subject: [PATCH] feat: add suggestion problem to knapsack knowledge --- contents/algorithms/dynamic-programming.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/contents/algorithms/dynamic-programming.md b/contents/algorithms/dynamic-programming.md index 6fc2bc40..2d072c16 100644 --- a/contents/algorithms/dynamic-programming.md +++ b/contents/algorithms/dynamic-programming.md @@ -16,7 +16,7 @@ Sometimes you do not need to store the whole DP table in memory, the last two va ## Recommended LeetCode questions -- 0/1 Knapsack +- 0/1 Knapsack or [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) - [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) - [Coin Change](https://leetcode.com/problems/coin-change/) - [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)