X

DAYS

:

HOUR

:

MINS

:

SEC

Copied to Clipboard
Power Set
Easy Accuracy: 48.41% Submissions: 22668 Points: 2

Given a string S, Find all the possible subsequences of the String in lexicographically-sorted order.

Example 1:

Input : str = "abc"
Output: a ab abc ac b bc c
Explanation : There are 7 subsequences that 
can be formed from abc.

Example 2:

Input: str = "aa"
Output: a a aa
Explanation : There are 3 subsequences that 
can be formed from aa.

Your Task:
You don't need to read input or print anything. 
Your task is to complete the function AllPossibleStrings() which takes S as the input parameter and returns a list of all possible substrings(non-empty) that can be formed from S in lexicographically-sorted order.

Expected Time Complexity: O(2n) where n is the length of the String
Expected Space Complexity: O(n * 2n)

 

Constraints: 
1 <= Length of String <= 16

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Power Set

Output Window