NeetCode #673LC-416Medium1-D Dynamic ProgrammingNC 150NC 250
← Back to All Problems#673 · #416 · Partition Equal Subset Sum(分割等和子集)
📌 Problem Statement & Constraints
Given a non-empty array
nums of positive integers, return whether it can be partitioned into two subsets with equal sums. Constraints: 1 <= nums.length <= 200, 1 <= nums[i] <= 100.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!