Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Partition Equal Subset Sum
Bookmark
Input
Example 1
Example 2
Example 3
Example 4
Custom
nums
=
[1, 5, 11, 5]
nums
1
5
11
5
can nums be split into two subsets with equal sum?
nums
1
5
11
5
can nums be split into two subsets with equal sum?
nums
1
5
11
5
sum =
22
target =
11
num
+1
dp
T
0
F
1
F
2
F
3
F
4
F
5
F
6
F
7
F
8
F
9
F
10
F
11
j-1 = 10
j = 11
dp[11]
← dp[
10
] =
F
sum 11 stays unreachable
nums
1
5
11
5
sum =
22
target =
11
num
+1
dp
T
0
F
1
F
2
F
3
F
4
F
5
F
6
F
7
F
8
F
9
F
10
F
11
j-1 = 5
j = 6
dp[6]
← dp[
5
] =
F
sum 6 stays unreachable
nums
1
5
11
5
sum =
22
target =
11
num
+1
dp
T
0
F
1
F
2
F
3
F
4
F
5
F
6
F
7
F
8
F
9
F
10
F
11
j-1 = 0
j = 1
dp[1]
← dp[1 -
1
] = dp[
0
] =
T
nums
1
5
11
5
sum =
22
target =
11
num
+5
dp
T
0
T
1
F
2
F
3
F
4
F
5
F
6
F
7
F
8
F
9
F
10
F
11
j-5 = 5
j = 10
dp[10]
← dp[
5
] =
F
sum 10 stays unreachable
nums
1
5
11
5
sum =
22
target =
11
num
+5
dp
T
0
T
1
F
2
F
3
F
4
F
5
T
6
F
7
F
8
F
9
F
10
F
11
j-5 = 0
j = 5
dp[5]
← dp[5 -
5
] = dp[
0
] =
T
nums
1
5
11
5
sum =
22
target =
11
num
+11
dp
T
0
T
1
F
2
F
3
F
4
T
5
T
6
F
7
F
8
F
9
F
10
T
11
j-11 = 0
j = 11
dp[11]
=
T
(0 + 11 = 11)
nums
1
5
11
5
sum =
22
target =
11
num
+5
dp
T
0
T
1
F
2
F
3
F
4
T
5
T
6
F
7
F
8
F
9
F
10
T
11
j-5 = 5
j = 10
dp[10]
← dp[10 -
5
] = dp[
5
] =
T
nums
1
5
11
5
sum =
22
target =
11
num
+5
dp
T
0
T
1
F
2
F
3
F
4
T
5
T
6
F
7
F
8
F
9
T
10
T
11
j-5 = 1
j = 6
dp[6]
← dp[6 -
5
] = dp[
1
] =
T
nums
1
5
11
5
sum =
22
target =
11
dp
T
0
T
1
F
2
F
3
F
4
T
5
T
6
F
7
F
8
F
9
T
10
T
11
dp[11] = T
, can partition, return
true
algo
master
.
io
Step:
Can nums be split into two subsets with equal sum?
0 / 46
Input
Example 1
Example 2
Example 3
Example 4
Custom
nums
=
[1, 5, 11, 5]
0 / 46
algo
master
.
io
Step:
Can nums be split into two subsets with equal sum?
