This visualization demonstrates how dynamic programming can be used to solve the Subset Sum problem. We have an array [1, 5, 11, 5] and want to determine if there's a subset that sums to 11.
We use a boolean DP table where dp[j] = true if a subset can sum to j, false otherwise. Initially, only dp[0] = true (empty subset sums to 0).