Array Subset Partition Equal Sum LeetCode (Partition Equal subset sum)

Partition problem is to determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is same.

Example 1:

• arr[] = {1, 5, 11, 5}
• Output: true
• Explanation: The array can be partitioned as {1, 5, 5} and {11}

Example 2:

• arr[] = {1, 5, 3}
• Output: false
• Explanation: The array cannot be partitioned into equal sum sets.

 This problem is popular in LeetCode and GeeksForGeeks. A collection of hundreds of interview questions and solutions are available in our blog at Interview Question Solutions

Solution: