How to generate all the possible combination?

#1

Please tell me how to generate all the combinations of number??

#2

see,

  1. recursion needs to be used
  2. combination of 2 digits or 1 a single digit can fetch u a result
    so in each recursive call we can create a number whose value + 64 would give a alphabet

if digit < 9
have a recursive call to next position in both i/p and o/p array{ increment i & j pointer by 1 }
also check if
then if ( digit > 9 and digit <=26) then have increase the i/p pointer by 2 and o/p pointer by 1

eg:
123

‘1’ ‘2’ ‘3’ = ABC
‘1’ ‘23’ = AW
‘12’ ‘3’ = LC

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