**Objective**: Given a String write an algorithm to print all the possible sub subsequences.

**Example:**

String input = “abc”;
Output: Possible sub sequences –
{Empty}, {a}, {b}, {c}, {ab} ,{a,c}, {b, c}, {a, b, c}

**Approach**:

- The approach will be similar to as discussed here Generate All Strings of n bits.
- If we consider n= 3(same as the string length) then all possible combinations are [0, 0, 0] [1, 0, 0] [0, 1, 0] [1, 1, 0] [0, 0, 1] [1, 0, 1] [0, 1, 1] [1, 1, 1].
- So from the above combinations, wherever the bit is set to 1, place an string character from index (same as position) at the position and wherever the bit is set to 0, ignore the string character at the index.
- The above step will give the desired result.
- See the code below for better understanding.

Time Complexity: O(2^n)

**Complete Code:**

**Output:**

a b c
a b
a c
a
b c
b
c
{Empty Set}

__________________________________________________

**Top Companies Interview Questions..-**

If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment.

__________________________________________________

### Like this:

Like Loading...

*Related*