:orphan:

Partition Equal Subset Sum
==========================

.. highlight:: none

Problem
-------
https://leetcode.com/problems/partition-equal-subset-sum/

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

::


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

**Example 2:**

::


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

 

**Constraints:**

- ``1 <= nums.length <= 200``
- ``1 <= nums[i] <= 100``

.. highlight:: python

Pattern
-------
Array, Dynamic Programming

Approaches
----------

.. tab-set::

    .. tab-item:: Dynamic Programming

        **Code**

        .. literalinclude:: ../problems/medium/partition-equal-subset-sum/partition_equal_subset_sum__dynamic_programming.py
            :language: python
            :lines: 10-

        **Test**

        >>> from partition_equal_subset_sum__dynamic_programming import canPartition
        >>> canPartition([1, 5, 11, 5])
        True
        >>> canPartition([1, 2, 3, 5])
        False

        .. autofunction:: partition_equal_subset_sum__dynamic_programming.canPartition