Mapped Strings problem

#1

need some hints unable to think the approach recursively

#2

@Divya_321 Here you need to partition the given number such that each partition contains a number <=26. Say if sample input is 123, then you can partition in following ways:
1|2|3 —> ABC
1|23 -----> AW
12|3 -----> LC
So take input the number in the form of a string so that it is easy to partition.
Following this, try to implement on yourself.

#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.

#4

will the number be always from 1 to 9 or 0 can too be here