Package g3501_3600.s3566_partition_array_into_two_equal_product_subsets

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3566 - Partition Array into Two Equal Product Subsets.

    Medium

    You are given an integer array nums containing distinct positive integers and an integer target.

    Determine if you can partition nums into two non-empty disjoint subsets , with each element belonging to exactly one subset, such that the product of the elements in each subset is equal to target.

    Return true if such a partition exists and false otherwise.

    A subset of an array is a selection of elements of the array.

    Example 1:

    Input: nums = 3,1,6,8,4, target = 24

    Output: true

    Explanation: The subsets [3, 8] and [1, 6, 4] each have a product of 24. Hence, the output is true.

    Example 2:

    Input: nums = 2,5,3,7, target = 15

    Output: false

    Explanation: There is no way to partition nums into two non-empty disjoint subsets such that both subsets have a product of 15. Hence, the output is false.

    Constraints:

    • 3 <= nums.length <= 12

    • <code>1 <= target <= 10<sup>15</sup></code>

    • 1 &lt;= nums[i] &lt;= 100

    • All elements of nums are distinct.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean checkEqualPartitions(IntArray nums, Long target)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait