Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. For example : ABC - A BC, AB C, ABC, A B C

Question

Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. For example : ABC -> A BC, AB C, ABC, A B C

Accepted Answer

Given a string, print all possible strings that can be made by placing spaces (zero or one) in between them.

Use recursion to generate all possible combinations of spaces
For each recursive call, either add a space or don't add a space between the current character and the next character
Base case is when there are no more characters left to add spaces between
Time complexity is O(2^n) where n is the length of the string

Accepted Answer

At max we can add n-1 spaces between the characters... so the answer will be 2+(n-1) which gives the answer in O(1) the 2 is because we can always write ABC and A B C these conditions will always be true for any string with length>=2. Edge case string length=1 we can handle it beforehand. I don't know if my approach is correct try correcting it if required.

Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. For example : ABC -> A BC, AB C, ABC, A B C

Top Amazon SDE-2 interview questions & answers

Popular interview questions of SDE-2

Top HR questions asked in Amazon SDE-2

Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. For example : ABC -&gt; A BC, AB C, ABC, A B C

Top Amazon SDE-2 interview questions & answers

Popular interview questions of SDE-2

Top HR questions asked in Amazon SDE-2

Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. For example : ABC -> A BC, AB C, ABC, A B C