class Solution:
  def findSubsets(self, nums):
    nums.sort()
    
    subsets = [[]]
    temp = []
    prev_count = 0
    
    # loop through each number
    for index, num in enumerate(nums):
     
      # for non duplicate case. clone previous subsets and append num to each
      if index == 0 or (index > 0 and nums[index] != nums[index - 1]):
        for subset in subsets:
            clone = subset[:]
            clone.append(num)
            temp.append(clone)
      
      # for duplicate case. clone the subsets from the point of prev_count  and append num to each
      else:
        for j in range(len(subsets) - prev_count, len(subsets)):
          clone = list(subsets[j])
          clone.append(num)
          temp.append(clone)
      
      # add the new items to the subsets
      for item in temp:
        subsets.append(item)

      prev_count = len(temp)
      temp = []

    return subsets