I am getting all lengths of strings but I only need fixed length equal to no. of characters in the question. So how can I approach this problem .I am facing a bit diffuculty while solving using recursion.
Can you also share some tips on how to visualise and utilize recursion effectively? I might find it really helpful if u can give some insights
I tried to print the permutations but I cant get correct output
hello @gvspraveen113
u are not using return statement in ur base case.
dry run on small test case (2-3 length string) will give decent idea about code flow.
can you provide any code for reference
check this->
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.