Partition Equal Subset Sum - LeetCode
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. Example 1: Example 2: Constraints: 1. Please don't post any solutions in this discussion. 2. The problem discussion is for asking questions about the problem or for sharing tips - anything except for solutions. 3. If you'd like to share your solution for feedback and ideas, please head to the solutions tab and post it there. Just a funny observation: you can pass 122/141 test cases just by noting that if the sum is odd, it has to be false. Little hint. The subset sum can only be the total sum divided by two. In depth hints that will help you solve the entire problem. Use as many as needed. Please upvote this took a while ☝️🤓 } Hi guys, I am so sorry for your inconvenience during working on this problem due to my carelessness. I will pay more attention and be more careful when preparing test cases and solutions in the f