Mapped string Problem

#1

how to solve this problem

#2

simply make an array of size 26
char arr={’ ',‘A’,‘B’,‘C’…};
and the use recursion to get ans
no need to use map you can use arr as map

#3

how I am able to make recurrence relation

#4

1)extract digit from given string int digit = str[i]-'0’
2) first make one digit num and store character corresponding to that digit in output array int num=digit; output[j]=(‘A’+digit-1);
3) now make two digit num and if num<26 then store character corresponding to that digit in output array if(str[1]!=’\0’)digit=(str[0]-‘0’)10+(str[1]-‘0’)
4) in base case when str[i]==’\0’ print output array and return;

i hope you underestand now try this approach and implement it

#5

https://ide.codingblocks.com/s/229208 I am unable to solve this question

#6

hi @vivekpatel
you have not call recursion at appropriate place
also when you have consider 2 digits then i=i+1 and j=j+1

modified code

#7

i hope this help
if you have more doubts regarding this feel free to ask
if your doubt is resolved mark it as resolved from your doubt section inside your course

#8

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.