From 67059d0b9c0d98eb2982e8538bb4448e57e13d86 Mon Sep 17 00:00:00 2001
From: truongductri01 <58579187+truongductri01@users.noreply.github.com>
Date: Thu, 7 Oct 2021 12:19:58 -0500
Subject: [PATCH] feat: add suggestion problem to knapsack knowledge (#239)

---
 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/)