Count Unique Subsets

Problem

Given nums that may contain duplicates, return the number of distinct subsets, including the empty subset.

A value appearing c times can contribute 0 through c copies, giving c + 1 independent choices. Multiply those choices across all distinct values.

Hint

Identical values are interchangeable, so only their multiplicity matters.

case 1

in: [[1,2,3]]

expected: 8

case 2

in: [[1,1,2]]

expected: 6

case 3

in: [[1,1,1]]

expected: 4

case 4

in: [[]]

expected: 1

case 5

in: [[1,2,2]]

expected: 6

Starter codePython

def count_unique_subsets(nums):
    # Your code here
    pass

5 test cases · run your code against them in the editor