How to do this ? some other doubt

#1
#2

hello @hg11110000 please wait i have to see the question and have to solve first then only i will be able to tell you .
please try another question till then .

#3

@tusharaggarwal272

any updates ?

#4

@hg11110000 have you seen the discussion part of this question .

#5

@tusharaggarwal272
saw but didnt got the approach

#6

one trick of doint this question is that you can maintian one count and see if that count shouldnt be greater than n .
you can make two recursion calls as we can repeat character also .
one to increment the letter ascii value i.e to check for next letter and without incrementing to the next letter .
in this way when your count becomes equal to the n you can return the string .

#7

i m able to think of a solution but not able to convert my thought into a code :((

@tusharaggarwal272

#8

hey @hg11110000 wait i will provide you the code as well .
please wait till then .

#9

hey @hg11110000 please see this :


i have written the code and now it is passing every testcase .
if you dont understand anything you can ask me .
Happy Learning!!

#10

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.