Power Set P(S) of a set S is the set of all subsets of S. For example S = {a, b, c} then P(s) = {{}, {a}, {b}, {c}, {a,b}, {a, c}, {b, c}, {a, b, c}}. If S has n elements in it then P(s) will have 2n elements
Examples
Input: s = "ab"
Output: "", "a", "b", "ab"
Explanation: The power set of "ab" includes all possible subsets: empty set, single characters, and full string.
Input: s = "abc"
Output: "", "a", "b", "c", "ab", "bc", "ac", "abc"
Explanation: The power set of "abc" includes all subsets formed by choosing any combination of its characters.
Input: s = "a"
Output: "", "a"
Explanation: The power set of "a" consists of the empty set and the single character itself.
Approach: By Using Binary Representation of Numbers from 0 to 2^n - 1
For a given set[] S, the power set can be found by generating all binary numbers between 0 and 2n-1, where n is the size of the set.
Set = [a,b,c]
power_set_size = pow(2, 3) = 8
Run for binary counter = 000 to 111. We consider a when the last bit is set and do not consider if the last bit is not set. We do the same thing for b and second bit, and for c and first bit.
Value of Counter Subset
000 -> Empty set
001 -> a
010 -> b
011 -> ab
100 -> c
101 -> ac
110 -> bc
111 -> abc
Detailed Steps:
- Get the size of power set
- powet_set_size = pow(2, set_size)
- Loop for counter from 0 to pow_set_size
- Loop for i = 0 to set_size
- If ith bit in counter is set. Print ith element from set for this subset
- Print separator for subsets i.e., newline
C++
// C++ program to find the power set using
// binary representation of a number.
#include <bits/stdc++.h>
using namespace std;
vector<string> allPossibleStrings(string &s) {
int n = s.size();
vector<string> res;
// Iterate through all subsets (represented by 0 to 2^n - 1)
for (int i = 0; i < (1 << n); i++) {
string sub = "";
for (int j = 0; j < n; j++) {
if (i & (1 << j)) sub += s[j];
}
res.push_back(sub);
}
return res;
}
int main() {
string s = "abc";
vector<string> subsets = allPossibleStrings(s);
for (string sub : subsets) cout << sub << endl;
return 0;
}
// Java program to find the power set using
// binary representation of a number.
import java.util.ArrayList;
import java.util.List;
class GfG {
static List<String> AllPossibleStrings(String s)
{
int n = s.length();
List<String> res = new ArrayList<>();
// Iterate through all subsets (represented by 0 to
// 2^n - 1)
for (int i = 0; i < (1 << n); i++) {
StringBuilder sub = new StringBuilder();
for (int j = 0; j < n; j++) {
// Check if the j-th bit is set in i
if ((i & (1 << j)) != 0) {
sub.append(s.charAt(j));
}
}
res.add(sub.toString()); // Add the subset to
// the result
}
return res;
}
public static void main(String[] args)
{
String s = "abc";
List<String> subsets = AllPossibleStrings(s);
// Print all subsets
for (String sub : subsets) {
System.out.println(sub);
}
}
}
# Python program to find the power set using
# binary representation of a number.
def allPossibleStrings(s):
n = len(s)
result = []
# Iterate through all subsets (represented by 0 to 2^n - 1)
for i in range(1 << n):
subset = ""
for j in range(n):
# Check if the j-th bit is set in i
if i & (1 << j):
subset += s[j]
# Add the subset to the result
result.append(subset)
return result
if __name__ == "__main__":
s = "abc"
subsets = allPossibleStrings(s)
for subset in subsets:
print(subset)
// C# program to find the power set using
// binary representation of a number.
using System;
using System.Collections.Generic;
class GfG {
static List<string> allPossibleStrings(string s) {
int n = s.Length;
List<string> result = new List<string>();
// Iterate through all subsets (represented by 0 to
// 2^n - 1)
for (int i = 0; i < (1 << n); i++) {
string subset = "";
for (int j = 0; j < n; j++) {
// Check if the j-th bit is set in i
if ((i & (1 << j)) != 0) {
subset += s[j];
}
}
result.Add(subset);
}
return result;
}
static void Main(string[] args) {
string s = "abc";
List<string> subsets = allPossibleStrings(s);
foreach(string subset in subsets) {
Console.WriteLine(subset);
}
}
}
// JavaScript program to find the power set using
// binary representation of a number.
function allPossibleStrings(s) {
const n = s.length;
const result = [];
// Iterate through all subsets (represented by 0 to 2^n
// - 1)
for (let i = 0; i < (1 << n);
i++) {
let subset = "";
for (let j = 0; j < n; j++) {
// Check if the j-th bit is set in i
if (i & (1 << j)) {
subset += s[j];
}
}
result.push(subset);
}
return result;
}
const s = "abc";
const subsets = allPossibleStrings(s);
subsets.forEach(subset => console.log(subset));
Time Complexity: O(n * 2n)
Auxiliary Space: O(1)
Approach: Power set using Previous Permutation
We can generate power set using previous permutation. In auxiliary array of bool set all elements to 0. That represent an empty set.
- Set first element of auxiliary array to 1 and generate all permutations to produce all subsets with one element.
- Then set the second element to 1 which will produce all subsets with two elements, repeat until all elements are included.
C++
// C++ program to find the power set using
// prev_permutation
#include <bits/stdc++.h>
using namespace std;
vector<string> allPossibleStrings(string &s) {
int n = s.size();
vector<string> res;
// Initialize a boolean array to represent
// the inclusion of each character
// Initially, no character is included
vector<bool> contain(n, false);
// Print the empty subset (which is always
// part of the power set)
res.push_back("");
// Loop through all possible combinations of
// characters
for (int i = 1; i <= n; i++) {
// Generate the combinations of size 'i'
// using prev_permutation
fill(contain.begin(), contain.end(), false);
for (int j = 0; j < i; j++) {
// Mark the first 'i' elements to be included
contain[j] = true;
}
do {
string subset = "";
for (int j = 0; j < n; j++) {
if (contain[j]) {
// Add the character to the subset if it's marked
subset += s[j];
}
}
// Add the subset to the result
res.push_back(subset);
} while (prev_permutation(contain.begin(), contain.end()));
}
return res;
}
int main() {
string s = "abc";
vector<string> subsets = allPossibleStrings(s);
for (const string &sub : subsets) {
cout << sub << endl;
}
return 0;
}
// Java program to find the power set using
// prev_permutation
import java.util.*;
class GfG {
static List<String> allPossibleStrings(String s) {
int n = s.length();
List<String> res = new ArrayList<>();
// Iterate through all subsets (represented by 0 to
// 2^n - 1)
for (int i = 0; i < (1 << n); i++) {
StringBuilder subset = new StringBuilder();
for (int j = 0; j < n; j++) {
// If the j-th bit is set in i, include the
// j-th character from s
if ((i & (1 << j)) != 0) {
subset.append(s.charAt(j));
}
}
res.add(subset.toString());
}
return res;
}
public static void main(String[] args) {
String s = "abc";
List<String> subsets = allPossibleStrings(s);
for (String subset : subsets) {
System.out.println(subset);
}
}
}
# Python program to find the power set using
# prev_permutation'
def allPossibleStrings(s):
n = len(s)
result = []
# Iterate through all subsets (represented
# by 0 to 2^n - 1)
# 1 << n is equivalent to 2^n
for i in range(1 << n):
subset = ""
for j in range(n):
# If the j-th bit is set in i, include
# the j-th character from s
if i & (1 << j):
subset += s[j]
result.append(subset)
return result
if __name__ == "__main__":
s = "abc"
subsets = allPossibleStrings(s)
for subset in subsets:
print(subset)
// C# program to find the power set using
// prev_permutation
using System;
using System.Collections.Generic;
class GfG {
static List<string> allPossibleStrings(string s) {
int n = s.Length;
List<string> result = new List<string>();
// Iterate through all subsets (represented by 0 to
// 2^n - 1)
for (int i = 0; i < (1 << n);
i++) {
string subset = "";
for (int j = 0; j < n; j++) {
// If the j-th bit is set in i, include the
// j-th character from s
if ((i & (1 << j)) != 0) {
subset += s[j];
}
}
result.Add(subset);
}
return result;
}
static void Main(string[] args) {
string s = "abc";
List<string> subsets = allPossibleStrings(s);
foreach(string subset in subsets) {
Console.WriteLine(subset);
}
}
}
// JavaScript program to find the power set using
// prev_permutation
function allPossibleStrings(s) {
const n = s.length;
const result = [];
// Iterate through all subsets (represented by 0 to 2^n
// - 1)
for (let i = 0; i < (1 << n);
i++) {
let subset = [];
for (let j = 0; j < n; j++) {
// If the j-th bit is set in i, include the j-th
// character from s
if ((i & (1 << j)) !== 0) {
subset.push(s[j]);
}
}
result.push(subset.join(""));
}
return result;
}
const s = "abc";
const subsets = allPossibleStrings(s);
subsets.forEach(subset => { console.log(subset); });
Time Complexity: O(n * 2n)
Auxiliary Space: O(n)
Related article:
Recursive program to generate power set
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem