Get Subsequence

easy

1. You are given a string str.
2. Complete the body of getSS function - without changing signature - to calculate all subsequences of str.
Use sample input and output to take idea about subsequences.

Note -&gt; The online judge can't force you to write the function recursively but that is what the spirit of question is.
Write recursive and not iterative logic. The purpose of the question is to aid learning recursion and not test you.

Input Format

A string str

Output Format

Contents of the arraylist containing subsequences as shown in sample output

Constraints

0 &lt;= str.length &lt;= 20

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

abc

Output

[, c, b, bc, a, ac, ab, abc]

Get Kpc