Partition Equal Subset Sum at eBay
Medium49.2% acceptance
This problem has 87.5% frequency at eBay.
Problem Description
Given an integer array `nums`, return `true` _if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or_`false` _otherwise_.
Read full problem and hintsTopics
Also asked at 16 companies
More eBay Questions
Remove One Element to Make the Array Strictly IncreasingEasyMinimize Maximum Pair Sum in ArrayMediumSpiral MatrixMediumTwo SumEasyLongest Palindromic SubstringMedium
View all eBay questions