LeetCode - Partition Equal Subset Sum
Given a non-empty array nums containing only positive integers, determine whether the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.
Example 1:
<strong>Input:</strong> nums = [1,5,11,5]
<strong>Output:</strong> true
<strong>Explanation:</strong> The array can ...
Posted on Fri, 18 Sep 2026 16:15:47 +0000 by verycleanteeth