Smart Keypad - I

#1

I don’t understand what the question says, can anyone elaborate it pls

#2

Hi @arsh23
Every recursion problem can be done by dividing that into 3 parts i.e Bigger problem Smaller Problem and Self work. Similarly in this question :-

  • Bigger Problem : To Print the codes for given whole length String.
  • Smaller Problem : Assume the recursion works and will give you ans for String of length n - 1 .
    Self Work : In order to make you smaller prblm your problem all you need to work for the first character and add one by one your all possible codes in the ans and the work will be done.

I Hope you are clear now if you still face any issue please let me know.

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