cpp-flashcards/org/study_deck_02/dsa/1-d-dynamic-programming/0416-partition-equal-subset-sum.org

#+ANKI_DECK: study_deck_02
* TODO 0416. Partition Equal Subset Sum :medium:
:PROPERTIES:
:NEETCODE: [[file:../../roadmap.org::*0416. Partition Equal Subset Sum][0416. Partition Equal Subset Sum]]
:END:

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:*


#+begin_src
Input: nums = [1,5,11,5]
Output: true
Explanation: The array can be partitioned as [1, 5, 5] and [11].
#+end_src


*Example 2:*


#+begin_src
Input: nums = [1,2,3,5]
Output: false
Explanation: The array cannot be partitioned into equal sum subsets.
#+end_src


*Constraints:*

 - ~1 <= nums.length <= 200~

 - ~1 <= nums[i] <= 100~

** TODO Approach
Write your approach here.

** TODO Python
#+begin_src python :lc-problem 416 :lc-lang python3
class Solution:
    def canPartition(self, nums: List[int]) -> bool:
#+end_src

** TODO C++
#+begin_src cpp :lc-problem 416
class Solution {
public:
    bool canPartition(vector<int>& nums) {
        
    }
};
#+end_src