**Problem Description** ====================== ### Problem Statement Given an integer array `nums`, determine if it's possible to partition the array into two subsets such that each subset has a sum that is equal to half of the total sum of `nums`. ### Rules and Constraints * The `nums` array will contain only non-negative integers. * The sum of the elements in each subset should be equal, and the total sum of the elements in both subsets should be equal to half of the total sum of `nums`. * It is guaranteed that the sum of all elements in `nums` is even. * There may be multiple ways to partition the array, but it is not necessary to find all such partitions. * The solution should return `true` if a valid partition exists, and `false` otherwise. ### Notes The problem is a variation of the subset sum problem, but with an additional constraint that the sums of the two subsets should be equal. This requires a more complex solution that takes into account the parity of the total sum and the need for two equal subsets. ### Example **Input:** {"input_data":[1,2,3]} **Output:** [1,2,3]