What is the upper bound complexity of this solution?
Complexity of the solution
Since there exists 2^n subsequences of a string of length n, so it should atleast take 2^n time to generate all of them and also, since for each subsequence, we need to add it to the ans at the end, it takes time proportional to it’s length,
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.