hello TA can you tell me what wrong with my code ,And how to solve it
my code is at:-
Codes of strings problem ,I could not find answer
@Love
I am having some trouble understanding your algorithm. Can you please explain it in brief ?
Meanwhile I’ll simply share my approach to this problem.
Traverse the string from left to right.
At each instance , push the alphabet corresponding to s[i] into your output string and make the recursive call to print the corresponding alphabet string for s.substring(1) .
This was the first recursive call.
Now check whether the number obtained from converting s[i] and s[i+1] , the double digit number is between 1 to 26. If not , leave it. However if it is in 1 to 26 , then find the corresponding alphabet to it , add it your output string and then make the recursive all to print corresponding string for s.substring(2)
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.