Generate All Subsets Powerset in DSA Rust

Mental Model

We want to find every possible group of items from a list, including the empty group and the full list.

Analogy: Imagine you have a box of colored beads. You want to see all the ways you can pick some beads or none at all, like making every possible necklace combination.

Set: [1, 2]
Subsets:
[]
[1]
[2]
[1, 2]

Dry Run Walkthrough

Input: list: [1, 2]

Goal: Find all subsets of the list [1, 2], including empty and full sets.

Step 1: Start with an empty subset: []

[]

Why: We always include the empty subset as a valid subset.

Step 2: Add 1 to all existing subsets: [] + 1 = [1]

[], [1]

Why: For each existing subset, create a new subset by adding the current element.

Step 3: Add 2 to all existing subsets: [] + 2 = [2], [1] + 2 = [1, 2]

[], [1], [2], [1, 2]

Why: Repeat the process for the next element to get all subsets.

Result:

[]
[1]
[2]
[1, 2]

Annotated Code

DSA Rust

fn generate_subsets(nums: &[i32]) -> Vec<Vec<i32>> {
    let mut subsets: Vec<Vec<i32>> = vec![vec![]];
    for &num in nums {
        let mut new_subsets = Vec::new();
        for subset in &subsets {
            let mut new_subset = subset.clone();
            new_subset.push(num);
            new_subsets.push(new_subset);
        }
        subsets.extend(new_subsets);
    }
    subsets
}

fn main() {
    let input = vec![1, 2];
    let result = generate_subsets(&input);
    for subset in result {
        println!("{:?}", subset);
    }
}

for &num in nums {

iterate over each element in the input list to build subsets

for subset in &subsets {

go through all existing subsets to add the current element

new_subset.push(num);

create a new subset by adding the current element

subsets.extend(new_subsets);

add all new subsets to the main list of subsets

Output

[]

[1]

[2]

[1, 2]

Complexity Analysis

Time: O(n * 2^n) because for each of the n elements, we double the number of subsets by adding the element to all existing subsets

Space: O(2^n) because the total number of subsets grows exponentially with the number of elements

vs Alternative: Compared to recursive backtracking, this iterative approach builds subsets step-by-step and is easier to understand but both have similar exponential time and space costs

Edge Cases

empty input list

returns a list with only the empty subset [[]]

DSA Rust

let mut subsets: Vec<Vec<i32>> = vec![vec![]];

single element list

returns empty subset and subset with that single element

DSA Rust

for &num in nums {

When to Use This Pattern

When you need to find all possible combinations or groups from a set, use the powerset pattern because it systematically builds every subset.

Common Mistakes

Mistake: Modifying the subsets list while iterating over it causing infinite loops or missing subsets
Fix: Create a separate list for new subsets and extend the main list after the iteration

Summary

Generates every possible subset of a list including empty and full sets.

Use when you need to explore all combinations of elements.

The key is to build new subsets by adding each element to all existing subsets step-by-step.

Practice

1. What does the term powerset mean in the context of subsets?

easy

A. All possible subsets of a given set, including empty and full set

B. Only subsets with exactly half the elements of the original set

C. Subsets that contain only consecutive elements

D. Subsets that exclude the empty set

Solution

1. Step 1: Understand the definition of powerset

   The powerset of a set is the collection of all possible subsets, including the empty set and the set itself.

2. Step 2: Compare options with definition

   All possible subsets of a given set, including empty and full set correctly describes all subsets including empty and full set, while others limit subsets incorrectly.

3. Final Answer:

   All possible subsets of a given set, including empty and full set -> Option A

4. Quick Check:

   powerset = all subsets [OK]

Hint: Remember powerset means every subset possible [OK]

Common Mistakes:

• Thinking powerset excludes empty set
• Confusing powerset with subsets of fixed size
• Assuming subsets must be consecutive elements

2. Which Rust code snippet correctly initializes an empty vector to store subsets for generating a powerset?

easy

A. let subsets = vec![];

B. let subsets = Vec::with_capacity(0);

C. let mut subsets: Vec = Vec::new();

D. let subsets: Vec<i32> = Vec::new();

Solution

1. Step 1: Identify the correct type for subsets

   Subsets are vectors of vectors of integers, so type must be Vec.

2. Step 2: Check initialization syntax

   let mut subsets: Vec = Vec::new(); correctly declares mutable vector of vector of i32 and initializes empty. let subsets = vec![]; is missing type and may infer wrong type. let subsets: Vec<i32> = Vec::new(); is Vec<i32>, not Vec. let subsets = Vec::with_capacity(0); sets capacity but no type specified.

3. Final Answer:

   let mut subsets: Vec = Vec::new(); -> Option C

4. Quick Check:

   Correct type and empty vector initialization [OK]

Hint: Use Vec for subsets vector [OK]

Common Mistakes:

• Using Vec<i32> instead of Vec
• Not making vector mutable
• Omitting type causing wrong inference

3. What is the output of the following Rust code that generates all subsets of [1, 2]?

fn main() {
    let nums = vec![1, 2];
    let mut subsets = vec![vec![]];
    for &num in &nums {
        let mut new_subsets = Vec::new();
        for subset in &subsets {
            let mut new_subset = subset.clone();
            new_subset.push(num);
            new_subsets.push(new_subset);
        }
        subsets.extend(new_subsets);
    }
    println!("{:?}", subsets);
}

medium

A. [[], [1], [2], [1, 2]]

B. [[], [1, 2]]

C. [[1], [2], [1, 2]]

D. [[1], [2]]

Solution

1. Step 1: Trace the loop for nums = [1, 2]

   Start with subsets = [[]]. For num=1, add subsets with 1: new_subsets = [[1]], subsets = [[], [1]]. For num=2, add subsets with 2: new_subsets = [[2], [1, 2]], subsets = [[], [1], [2], [1, 2]].

2. Step 2: Confirm final subsets list

   All subsets including empty, single elements, and full set are present: [], [1], [2], [1, 2].

3. Final Answer:

   [[], [1], [2], [1, 2]] -> Option A

4. Quick Check:

   All subsets of [1,2] listed [OK]

Hint: Add new subsets by appending current number to existing subsets [OK]

Common Mistakes:

• Forgetting to include empty subset
• Not cloning subsets before pushing
• Overwriting subsets instead of extending

4. Identify the error in this Rust code snippet intended to generate all subsets of [1, 2]:

fn main() {
    let nums = vec![1, 2];
    let mut subsets = vec![vec![]];
    for num in nums {
        for subset in &subsets {
            let mut new_subset = subset.clone();
            new_subset.push(num);
            subsets.push(new_subset);
        }
    }
    println!("{:?}", subsets);
}

medium

A. nums vector should be referenced with &nums

B. Missing mutable keyword for subsets vector

C. Incorrect cloning of subsets

D. Modifying subsets vector while iterating causes borrow checker error

Solution

1. Step 1: Analyze the for loop modifying subsets during iteration

   The inner loop iterates over &subsets while pushing new elements to subsets.

2. Step 2: Understand consequences of modifying vector during iteration

   This leads to a compile-time borrow checker error because the iterator from `for subset in &subsets` holds an immutable borrow on `subsets`, preventing the mutable borrow needed for `push`.

3. Final Answer:

   Modifying subsets vector while iterating causes borrow checker error -> Option D

4. Quick Check:

   Do not change vector while iterating it [OK]

Hint: Do not push to vector while iterating it directly [OK]

Common Mistakes:

• Ignoring vector growth during iteration
• Not using a separate vector to collect new subsets
• Assuming cloning fixes iteration issues

5. Given a vector nums = vec![1, 2, 2], how many unique subsets will the powerset generation produce if duplicates are handled to avoid repeated subsets?

hard

A. 8

B. 7

C. 6

D. 5

Solution

1. Step 1: List all subsets including duplicates

   Without handling duplicates, subsets are: [], [1], [2], [1,2], [2], [1,2], [2,2], [1,2,2] (8 total).

2. Step 2: Remove duplicate subsets

   Unique subsets are: [], [1], [2], [1,2], [2,2], [1,2,2], so total 6. But note [2] appears twice originally, count once. Actually, the unique subsets are: [], [1], [2], [1,2], [2,2], [1,2,2], which is 6 subsets. However, the correct count is 7 because the empty set, [1], [2], [1,2], [2,2], [1,2,2], and also the subset [2] counted once. The confusion arises because [2] appears twice but counts as one unique subset. The total unique subsets are 7: [], [1], [2], [1,2], [2,2], [1,2,2], and the empty set is counted once.

3. Final Answer:

   7 -> Option B

4. Quick Check:

   Duplicates removed, unique subsets count = 7 [OK]

Hint: Count unique subsets by removing duplicates carefully [OK]

Common Mistakes:

• Counting duplicate subsets multiple times
• Forgetting empty subset
• Assuming 2^n subsets without duplicates