# partition equal subset sum

2) If sum of array elements is even, calculate sum/2 and find a subset of array with sum equal to sum/2. To do so, we will be maintaining a 2D DP state as following :Â. Partition Equal Subset Sum 中文解释 Chinese Version - Duration: 9:59. happygirlzt 512 views. Auxiliary space + the Input space i.e. The first step is simple. In this case, we will see if we can find a subset to get the remaining sum: If either of the two above scenarios is true, we can find a subset of numbers with a sum equal to âsâ. Partition to K Equal Sum Subsets in C++ C++ Server Side Programming Programming Suppose we have an array of integers called nums and a positive integer k, check whether it's possible to divide this array into k non-empty subsets whose sums are all same. Partition Equal Subset Sum. Here, state(idx, sum) tells us if it is possible to get a subset sum of the sum provided the elements from 0 to idx of the given array. 25 min. The basic idea was -> if dp[j] is achievable, then dp[i+num] is achievable if we pick the number num, and dp[i] is also achievable if we don't. Call stack might take up to O(n) space. Thinking of the solution with bitset. We define a recursive function, Partition that will return whether it’s possible to partition the given array into k subsets such that the sum of all is equal. If we can pick such a series of numbers from 0-i whose sum is j, dp[i][j] is true, otherwise it is false. The idea is to calculate the sum of all elements in the set. Space Complexity: O(1), if not considering recursion stack space. This changes the problem into finding if a subset of the input array has a sum of sum/2. Complexity Analysis: Time Complexity: O(sum*n), where sum is the ‘target sum’ and ‘n’ is the size of array. Description: This is a popular interview coding problem which has been featured in interview rounds of Amazon, Oyo rooms, Adobe. S 1 = {1,1,1,2} O(n) where n is the number of elements in the given input array. Auxiliary Space: O(sum*n), as the size of 2-D array is sum*n. Subset Sum Problem in O(sum) space Perfect Sum Problem (Print all subsets with given sum) Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above. We exclude the current item from the subset and recur for remaining items. Output Format: If it is possible to partition the given array s in an above-said manner then return a boolean array of size n, where its i (0<=i