Generate All Subsets Powerset in DSA C++ - Build from Scratch

Generate All Subsets (Powerset)

📖 Scenario: Imagine you have a small collection of unique items, like three different colored balls. You want to find all the possible groups you can make from these balls, including the empty group and the group with all balls.

🎯 Goal: Build a C++ program that takes a list of unique integers and generates all possible subsets (the powerset) of that list.

📋 What You'll Learn

Create a vector called nums with the exact values 1, 2, and 3

Create an empty vector of vectors called result to store all subsets

Use a variable n to store the size of nums

Use a for loop with variable i from 0 to (1 << n) - 1 to generate all subsets

Inside the loop, create a temporary vector called subset to hold the current subset

Use a nested for loop with variable j from 0 to n - 1 to check each bit of i

If the j-th bit of i is set, add nums[j] to subset

Add subset to result

Print all subsets in result in the format: [elements separated by space]

Print each subset on a new line

💡 Why This Matters

🌍 Real World

Generating all subsets is useful in situations like choosing combinations of items, testing all possible feature sets in machine learning, or solving puzzles.

💼 Career

Understanding how to generate powersets helps in algorithm design, combinatorial problems, and optimization tasks common in software development and data science.

1

Create the initial vector

Create a vector called nums with the exact values 1, 2, and 3.

DSA C++

# Create the vector nums with values 1, 2, and 3
# Your code here

Hint

Use std::vector<int> and initialize it with {1, 2, 3}.

2

Add variables for storing results and size

Add an empty vector of vectors called result to store all subsets and a variable n to store the size of nums.

DSA C++

#include 
#include 

int main() {
    std::vector nums = {1, 2, 3};
    // Create result vector and n variable
    // Your code here
    return 0;
}

Hint

Use std::vector<std::vector<int>> result; and int n = nums.size();.

3

Generate all subsets using bit manipulation

Use a for loop with variable i from 0 to (1 << n) - 1 to generate all subsets. Inside this loop, create a vector called subset. Use a nested for loop with variable j from 0 to n - 1. If the j-th bit of i is set, add nums[j] to subset. After the inner loop, add subset to result.

DSA C++

#include 
#include 

int main() {
    std::vector nums = {1, 2, 3};
    std::vector> result;
    int n = nums.size();
    // Generate subsets using bit manipulation
    // Your code here
    return 0;
}

Hint

Use bit shifting and bitwise AND to check if a bit is set.

4

Print all subsets

Use a for loop with variable k to iterate over result. For each subset, print the elements separated by spaces inside square brackets. Print each subset on a new line.

DSA C++

#include 
#include 

int main() {
    std::vector nums = {1, 2, 3};
    std::vector> result;
    int n = nums.size();

    for (int i = 0; i  subset;
        for (int j = 0; j < n; ++j) {
            if (i & (1 << j)) {
                subset.push_back(nums[j]);
            }
        }
        result.push_back(subset);
    }

    // Print all subsets
    // Your code here

    return 0;
}

Hint

Print each subset inside square brackets with spaces between elements. Print empty subsets as [].

Practice

1. What does the "Generate All Subsets (Powerset)" algorithm produce when given a set {1, 2}?

easy

A. Only subsets with two elements: {1, 2}

B. All possible subsets including empty set: {}, {1}, {2}, {1, 2}

C. Only subsets with one element: {1}, {2}

D. Only the empty set: {}

Solution

1. Step 1: Understand what subsets mean

   Subsets include all combinations of elements, from empty to full set.

2. Step 2: List all subsets of {1, 2}

   They are {}, {1}, {2}, and {1, 2}.

3. Final Answer:

   All possible subsets including empty set: {}, {1}, {2}, {1, 2} -> Option B

4. Quick Check:

   Subsets = all combinations [OK]

Hint: Remember powerset includes empty and full sets [OK]

Common Mistakes:

• Thinking subsets only have full or single elements
• Ignoring the empty subset
• Confusing subsets with permutations

2. Which of the following C++ code snippets correctly initializes an empty vector of vectors to store subsets?

easy

A. std::vector<int> subsets;

B. std::vector subsets = {{}};

C. std::vector subsets;

D. std::vector subsets<int>;

Solution

1. Step 1: Identify correct vector declaration

   We need a vector of vectors of int to store subsets.

2. Step 2: Check syntax correctness

   std::vector subsets; uses correct syntax: std::vector subsets; initializes empty vector of vectors.

3. Final Answer:

   std::vector subsets; -> Option C

4. Quick Check:

   Correct vector of vectors syntax [OK]

Hint: Use vector for subsets storage [OK]

Common Mistakes:

• Using vector<int> instead of vector
• Incorrect template syntax like vector subsets<int>
• Trying to initialize with empty braces incorrectly

3. What is the output of the following C++ code snippet?

std::vector<int> nums = {1, 2};
std::vector subsets = {{}};
for (int num : nums) {
    int n = subsets.size();
    for (int i = 0; i < n; i++) {
        std::vector<int> newSubset = subsets[i];
        newSubset.push_back(num);
        subsets.push_back(newSubset);
    }
}
for (auto &subset : subsets) {
    for (int x : subset) std::cout << x << " ";
    std::cout << "| ";
}

medium

A. | | 1 | 2 | 1 2 |

B. | | 1 2 | 1 | 2 |

C. | 1 | 2 | 1 2 |

D. | 1 2 | 1 | 2 |

Solution

1. Step 1: Understand initial subsets and loop

   Initially subsets = {{}}, empty subset only. For each num, we add new subsets by adding num to existing subsets.

2. Step 2: Trace iterations

   For num=1: subsets become {}, {1}. For num=2: subsets become {}, {1}, {2}, {1, 2}.

3. Final Answer:

   | | 1 | 2 | 1 2 | -> Option A

4. Quick Check:

   All subsets printed with spaces and separators [OK]

Hint: Start with empty subset and add elements iteratively [OK]

Common Mistakes:

• Missing the empty subset in output
• Printing subsets in wrong order
• Confusing push_back inside loop

4. Identify the error in this C++ code snippet for generating subsets:

std::vector<int> nums = {1, 2};
std::vector subsets;
for (int num : nums) {
    int n = subsets.size();
    for (int i = 0; i < n; i++) {
        std::vector<int> newSubset = subsets[i];
        newSubset.push_back(num);
        subsets.push_back(newSubset);
    }
}

medium

A. subsets vector is not initialized with empty subset before loop

B. Loop variable i should start from 1, not 0

C. newSubset.push_back(num) should be outside inner loop

D. nums vector should be empty to generate subsets

Solution

1. Step 1: Check initialization of subsets

   subsets is empty initially, so subsets.size() is 0, inner loop never runs.

2. Step 2: Identify missing empty subset

   We must start subsets with empty subset {{}} to build new subsets correctly.

3. Final Answer:

   subsets vector is not initialized with empty subset before loop -> Option A

4. Quick Check:

   Empty subset needed to start building subsets [OK]

Hint: Always start subsets with empty subset {{}} [OK]

Common Mistakes:

• Not initializing subsets with empty subset
• Changing loop start index incorrectly
• Misplacing push_back calls

5. Given a vector nums = {1, 2, 2}, which code modification ensures the generated subsets contain no duplicate subsets?

hard

A. Generate subsets normally; duplicates are impossible with vector<int>.

B. Use a set to store subsets after generation to remove duplicates.

C. Ignore duplicate elements in nums vector before generating subsets.

D. Sort nums first and skip adding duplicates during subset generation.

Solution

1. Step 1: Understand duplicates in input

   Input has duplicate 2's, so subsets like {2} can appear multiple times.

2. Step 2: Use sorting and skip duplicates

   Sorting nums helps detect duplicates; skip adding subsets with same element consecutively to avoid duplicates.

3. Final Answer:

   Sort nums first and skip adding duplicates during subset generation. -> Option D

4. Quick Check:

   Sorting + skipping duplicates avoids repeated subsets [OK]

Hint: Sort input and skip duplicates while generating subsets [OK]

Common Mistakes:

• Assuming duplicates never occur
• Removing duplicates from input loses valid subsets
• Using set after generation is less efficient