Dynamic Programming21 sections · 916 units
Open in Course

LeetCode 416 Partition Equal Subset Sum - Walkthrough

Tracing subset sum

Trace Partition Equal Subset Sum on [1,5,11,5][1, 5, 11, 5]. Total sum is 2222, so we need a subset summing to 1111. Build dp[s]dp[s] = true if sum ss is achievable. Start with dp[0]=truedp[0] = true.

After 11: dp[1]=truedp[1] = true. After 55: dp[5]=truedp[5] = true, dp[6]=truedp[6] = true. After 1111: dp[11]=truedp[11] = true, dp[16]=truedp[16] = true, dp[17]=truedp[17] = true. After second 55: dp[10]=truedp[10] = true, dp[11]dp[11] already true. Since dp[11]=truedp[11] = true, the answer is YES. The subset {5,5,1}\{5, 5, 1\} or {11}\{11\} works.