Unique Subsets Problem | Dataford Interview Questions

Mailchimp audience tooling may need to enumerate distinct combinations of integer-based segment identifiers. Given an integer list that may contain duplicate values, return all unique subsets, including the empty subset and the full list.

A subset may contain each occurrence at most once, but subsets with identical values must appear only once. The output order may be any deterministic order, and the examples use lexicographic depth-first order.

Formal Specification

Implement subsets_with_duplicates(nums), where nums is a list of integers. Return a list containing lists of integers. Each returned list must represent a unique subset, and no duplicate subset may be included.

Constraints

0 <= len(nums) <= 10
-10 <= nums[i] <= 10
The input may contain duplicate integers
The empty subset must be included

Function Signature

def subsets_with_duplicates(nums):

Your question is Unique Subsets Problem. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Formal Specification

Constraints

0 <= len(nums) <= 10
-10 <= nums[i] <= 10
The input may contain duplicate integers
The empty subset must be included

Function Signature

def subsets_with_duplicates(nums):

Your question is Unique Subsets Problem. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.