Consider below list where each digit from 1 to 9 maps to few characters.
1 -> ['A', 'B', 'C'] 2 -> ['D', 'E', 'F'] 3 -> ['G', 'H', 'I'] 4 -> ['J', 'K', 'L'] 5 -> ['M', 'N', 'O'] 6 -> ['P', 'Q', 'R'] 7 -> ['S', 'T', 'U'] 8 -> ['V', 'W', 'X'] 9 -> ['Y', 'Z']
Given a number, replace its digits with corresponding characters in given list and print all strings possible. Same character should be considered for every occurrence of a digit in the number. Input number is positive and doesn’t contain 0.
Input : 121 Output : ADA BDB CDC AEA BEB CEC AFA BFB CFC Input : 22 Output : DD EE FF
The idea is for each digit in the input number, we consider strings formed by previous digit and append characters mapped to current digit to them. If this is not the first occurrence of the digit, we append same character as used in its first occurrence.
ADA BDB CDC AEA BEB CEC AFA BFB CFC
This article is contributed by Aditya Goel. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Find the number of strings formed using distinct characters of a given string
- Strings formed from given characters without any consecutive repeating characters
- Find the largest number that can be formed by changing at most K digits
- Find maximum number that can be formed using digits of a given number
- Number formed by deleting digits such that sum of the digits becomes even and the number odd
- Find the count of numbers that can be formed using digits 3, 4 only and having length at max N.
- Greatest number less than equal to B that can be formed from the digits of A
- Recursive sum of digits of a number formed by repeated appends
- Find the numbers of strings that can be formed after processing Q queries
- Maximum number of strings that can be formed with given zeros and ones
- Find uncommon characters of the two strings
- Find uncommon characters of the two strings | Set 2
- Find smallest number with given number of digits and sum of digits under given constraints
- Find the count of sub-strings whose characters can be rearranged to form the given word
- Count the Number of matching characters in a pair of strings
Improved By : sanjeev2552