Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@avaiesshaik782 | 662 |

@arpitsatnalika | 629 |

@code_it_ | 591 |

@prakharxyz | 583 |

@tujhekya | 542 |

@Rahul Jadhav 1 | 458 |

@sivanandh03 | 448 |

@satyam0460 | 433 |

@iamronak | 424 |

@imnm | 424 |

@18eumc107 | 421 |

Complete Leaderboard |

Given a string S find all possible substrings of the string in lexicographically-sorted order.

**Example 1:**

**Input : **str = "abc"
**Output: **a ab abc ac b bc câ€‹
**Explanation : **There are 7 substrings that
can be formed from abc.

**Example 2:**

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

**Your Task:**

You don't need to read ot print anything. Your task is to complete the function **AllPossibleStrings() **which takes S as 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(2^{n}) where n is the length of the string

**Expected Space Complexity : **O(n * 2^{n})

**Constraints: **

1 <= Length of string <= 16

Login to report an issue on this page.

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

Yes
Power Set

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.