Suppose we have a list of numbers called nums, we have to check whether we can partition nums into two groups where the sum of the elements in both groups are same.
So, if the input is like nums = [2, 3, 6, 5], then the output will be True, as we can make groups like: [2, 6] and [3, 5].
To solve this, we will follow these steps
total := sum of all elements in nums
if total is odd, then
half := integer part of total / 2
dp := a list of size half + 1 and fill with false
dp := true
for each num in nums, do
for i in range half to 0, decrease by 1, do
if i >= num, then
dp[i] := dp[i] OR dp[i - num]
class Solution: def solve(self, nums): total = sum(nums) if total & 1: return False half = total // 2 dp = [True] + [False] * half for num in nums: for i in range(half, 0, -1): if i >= num: dp[i] |= dp[i - num] return dp[half] ob = Solution() nums = [2, 3, 6, 5] print(ob.solve(nums))
[2, 3, 6, 5]