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

Generate All Subsets Powerset

📖 Scenario: Imagine you have a small collection of unique fruits. You want to find all possible groups of these fruits, including the empty group and the group with all fruits. This helps you see every way you can combine your fruits.

🎯 Goal: Build a program that takes a list of fruits and generates all possible subsets (the powerset) of these fruits.

📋 What You'll Learn

Create a list of fruits with exact values: "apple", "banana", "cherry"

Create an empty list to hold all subsets called allSubsets

Use a loop to generate all subsets by checking each number from 0 to 2^n - 1 where n is the number of fruits

Inside the loop, create a subset list and add fruits based on the bits of the current number

Print all subsets in the format: [fruit1, fruit2, ...] including empty subset as []

💡 Why This Matters

🌍 Real World

Generating all subsets is useful in situations like choosing combinations of features, menu items, or options to test or analyze.

💼 Career

Understanding how to generate powersets helps in problem solving, algorithm design, and coding interviews.

1

Create the list of fruits

Create a list of strings called fruits with these exact values: "apple", "banana", "cherry"

DSA C#

# Your code here

Hint

Use List<string> and initialize it with the three fruit names inside curly braces.

2

Create the list to hold all subsets

Add a new empty list of lists of strings called allSubsets to hold all subsets of fruits

DSA C#

using System;
using System.Collections.Generic;

class Program
{
    static void Main()
    {
        List fruits = new List { "apple", "banana", "cherry" };
        // Create list to hold all subsets
        
        // Your code here
    }
}

Hint

Use List<List<string>> to hold multiple subsets.

3

Generate all subsets using bit manipulation

Use a for loop with variable i from 0 to (1 << fruits.Count) - 1. Inside the loop, create a new list called subset. Use another for loop with variable j from 0 to fruits.Count - 1. If the bit at position j in i is set, add fruits[j] to subset. After the inner loop, add subset to allSubsets.

DSA C#

using System;
using System.Collections.Generic;

class Program
{
    static void Main()
    {
        List fruits = new List { "apple", "banana", "cherry" };
        List> allSubsets = new List>();
        // Generate all subsets
        
        // Your code here
    }
}

Hint

Use bit shifting and bitwise AND to check if a fruit should be included in the current subset.

4

Print all subsets

Use a foreach loop with variable subset to iterate over allSubsets. Inside the loop, print the subset in the format: [fruit1, fruit2, ...]. For empty subsets, print [] exactly.

DSA C#

using System;
using System.Collections.Generic;

class Program
{
    static void Main()
    {
        List fruits = new List { "apple", "banana", "cherry" };
        List> allSubsets = new List>();

        int n = fruits.Count;
        for (int i = 0; i  subset = new List();
            for (int j = 0; j < n; j++)
            {
                if ((i & (1 << j)) != 0)
                {
                    subset.Add(fruits[j]);
                }
            }
            allSubsets.Add(subset);
        }

        // Print all subsets
        
        // Your code here
    }
}

Hint

Use string.Join to join fruits with comma and space, and wrap with square brackets.

Practice

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

easy

A. Only the subsets with even number of elements

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

C. Subsets that contain only one element

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 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. Other options limit subsets incorrectly.

3. Final Answer:

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

4. Quick Check:

   powerset = all subsets [OK]

Hint: Powerset means every subset possible, including empty [OK]

Common Mistakes:

• Thinking powerset excludes empty set
• Confusing powerset with subsets of fixed size
• Ignoring the full set as a subset

2. Which of the following C# code snippets correctly initializes an empty list of subsets for generating a powerset?

easy

A. var subsets = new List();

B. var subsets = new List<int>();

C. var subsets = new List();

D. var subsets = new List<int>(); subsets.Add(new List<int>());

Solution

1. Step 1: Identify the correct data structure for subsets

   Each subset is a list of integers, so the collection of subsets should be a list of lists of integers.

2. Step 2: Check each option's type

   var subsets = new List(); uses List, which is correct. var subsets = new List<int>(); is List<int> (single list), var subsets = new List(); is List (array instead of list), var subsets = new List<int>(); subsets.Add(new List<int>()); mixes types incorrectly.

3. Final Answer:

   var subsets = new List(); -> Option A

4. Quick Check:

   List of list<int> for subsets [OK]

Hint: Use List to hold all subsets [OK]

Common Mistakes:

• Using List<int> instead of List
• Confusing arrays with lists
• Adding elements before initializing list

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

var nums = new int[] {1, 2};
var subsets = new List { new List<int>() };
foreach (var num in nums) {
  int count = subsets.Count;
  for (int i = 0; i < count; i++) {
    var newSubset = new List<int>(subsets[i]) { num };
    subsets.Add(newSubset);
  }
}
foreach (var subset in subsets) {
  Console.Write(string.Join(",", subset) + "|");
}

medium

A. | |1|2|

B. |1|2|1,2|

C. | |1|2|1,2|

D. |1|2|

Solution

1. Step 1: Trace initial subsets list

   Initially subsets contains one empty list: [[]].

2. Step 2: Process first number 1

   For num=1, we add subsets: [1] to subsets. Now subsets = [[], [1]].

3. Step 3: Process second number 2

   For num=2, we add subsets: [2] and [1,2]. Now subsets = [[], [1], [2], [1,2]].

4. Step 4: Print all subsets

   Empty subset prints as "|", so output is "| |1|2|1,2|".

5. Final Answer:

   | |1|2|1,2| -> Option C

6. Quick Check:

   All subsets printed with empty first [OK]

Hint: Empty subset prints as empty string before others [OK]

Common Mistakes:

• Ignoring empty subset in output
• Not copying subsets before adding new element
• Miscounting subsets during iteration

4. Identify the error in the following C# code for generating subsets:

var nums = new int[] {1, 2};
var subsets = new List();
foreach (var num in nums) {
  int count = subsets.Count;
  for (int i = 0; i < count; i++) {
    var newSubset = new List<int>(subsets[i]) { num };
    subsets.Add(newSubset);
  }
}

medium

A. subsets list is not initialized with empty subset

B. Using List<int> instead of List

C. Incorrect loop range in inner for loop

D. Adding elements to subsets inside foreach causes runtime error

Solution

1. Step 1: Check initialization of subsets

   subsets is empty initially, so count is 0 and inner loop never runs.

2. Step 2: Understand consequence

   Without starting with empty subset, no new subsets are generated.

3. Final Answer:

   subsets list is not initialized with empty subset -> Option A

4. Quick Check:

   Empty subset needed to start [OK]

Hint: Always start subsets with empty list to generate powerset [OK]

Common Mistakes:

• Not adding empty subset before loop
• Assuming subsets auto-initialize
• Modifying list while iterating without base case

5. Given a list nums = new List<int> {1, 2, 2}, which modification to the standard powerset generation code will correctly generate all unique subsets without duplicates?

hard

A. Use a HashSet to store subsets as strings to avoid duplicates

B. Add all subsets without any check; duplicates will be filtered later

C. Use a Dictionary to map counts and generate subsets

D. Sort nums and skip adding duplicate elements in inner loop

Solution

1. Step 1: Understand duplicate problem

   Input has duplicates (2 appears twice), so normal powerset code generates duplicate subsets.

2. Step 2: Identify correct approach

   Sorting nums allows skipping duplicates during subset generation to avoid repeated subsets.

3. Step 3: Evaluate options

   Sort nums and skip adding duplicate elements in inner loop correctly describes sorting and skipping duplicates. Use a HashSet to store subsets as strings to avoid duplicates is workaround but less efficient. Add all subsets without any check; duplicates will be filtered later allows duplicates. Use a Dictionary to map counts and generate subsets is unrelated.

4. Final Answer:

   Sort nums and skip adding duplicate elements in inner loop -> Option D

5. Quick Check:

   Sort and skip duplicates to avoid repeats [OK]

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

Common Mistakes:

• Not sorting input before generating subsets
• Trying to remove duplicates after generation
• Using complex data structures unnecessarily