Mapped String recursion

#1

Running for sample test case but fails while submitting.

#2

according to your code
for this input 1263
output is
ABFC
AB
AZC
LFC
L
which is wrong
if no is >26 then you can’t call further
so you have to add an if condition
like this

if(no<=26){

         ch=no +'A'-1;

        out[j]=ch;

        findString(a,i+2,j+1,out);

    }

you can check your modified Code below

Modified Code

i hope this help
if your doubt is resolved
don’t forgot to mark it as resolved from your side

#3

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.