345678910111213141516171819202122232425262728293031323334353637383940

class Solution:
    def func(self, ind, arr, nums, ans):
        # If index reaches the end of nums
        if ind == len(nums):
            # Add the current subset (arr) to the result
            ans.append(arr.copy())
            return
        
        # Include the current element in the subset
        arr.append(nums[ind])
        # Recur for the next index
        self.func(ind + 1, arr, nums, ans)
        # Backtrack: remove the current element from the subset
        arr.pop()
        
        # Skip duplicates and recur for the next unique element
        for j in range(ind + 1, len(nums)):
            if nums[j] != nums[ind]:
                self.func(j, arr, nums, ans)
                return
        
        # Ensure the function finishes when no more unique elements are left
        self.func(len(nums), arr, nums, ans)
    
    def subsetsWithDup(self, nums):
        ans = []  # Resulting list of subsets
        arr = []  # Current subset
        nums.sort()  # Sort the array to handle duplicates
        self.func(0, arr, nums, ans)  # Start recursion
        return ans

if __name__ == "__main__":
    sol = Solution()
    nums = [1, 2, 2]  # Example input
    result = sol.subsetsWithDup(nums)
    
    # Print the resulting subsets
    for subset in result:
        print(subset)

12345678910111213141516171819202122232425262728293031323334353637383940414243444546

class Solution {
    func(ind, arr, nums, ans) {
        // If index reaches the end of nums
        if (ind === nums.length) {
            // Add the current subset (arr) to the result
            ans.push([...arr]);
            return;
        }
        
        // Include the current element in the subset
        arr.push(nums[ind]);
        // Recur for the next index
        this.func(ind + 1, arr, nums, ans);
        // Backtrack: remove the current element from the subset
        arr.pop();
        
        // Skip duplicates and recur for the next unique element
        for (let j = ind + 1; j < nums.length; j++) {
            if (nums[j] !== nums[ind]) {
                this.func(j, arr, nums, ans);
                return;
            }
        }
        
        // Ensure the function finishes when no more unique elements are left
        this.func(nums.length, arr, nums, ans);
    }

    subsetsWithDup(nums) {
        const ans = [];  // Resulting list of subsets
        const arr = [];  // Current subset
        nums.sort((a, b) => a - b);  // Sort the array to handle duplicates
        this.func(0, arr, nums, ans);  // Start recursion
        return ans;
    }
}

const sol = new Solution();
const nums = [1, 2, 2];  // Example input