 New update is available. Click here to update.

# Partition Equal Subset Sum

Medium 0/80
Avg time to solve 25 mins
Success Rate 65 % Share 67 upvotes

## Problem Statement

#### For example, let’s say the given array is [2, 3, 3, 3, 4, 5], then the array can be partitioned as [2, 3, 5], and [3, 3, 4] with equal sum 10.

``````Can you solve this using not more than O(S) extra space, where S is the sum of all elements of the given array?
``````
Detailed explanation ( Input/output format, Notes, Images ) ##### Constraints:
``````1 <= 'T' <= 10
1 <= 'N' <= 100
1 <= 'ARR'[i] <= 100

Time Limit: 1 sec
``````
##### Sample Input 1:
``````2
6
3 1 1 2 2 1
5
5 6 5 11 6
``````
##### Sample Output 1:
``````true
false
``````
##### Explanation Of Sample Input 1:
``````For the first test case, the array can be partitioned as ([2,1,1,1] and [3, 2]) or ([2,2,1], and [1,1,3]) with sum 5.

For the second test case, the array can’t be partitioned.
``````
##### Sample Input 2:
``````2
9
2 2 1 1 1 1 1 3 3
6
8 7 6 12 4 5
``````
##### Sample Output 2:
``````false
true
``````  Auto Console