Given an integer N as input, the task is to print the all the string combination from it in lexicographical order.
Input : 191 Output : aia sa Explanation: The Possible String digit are 1, 9 and 1 --> aia 19 and 1 --> sa Input : 1119 Output : aaai aas aki kai ks
- Get the String and find all its combination list in the given order.
- Find the list whose integers lies in the range of 0 to 25.
- Convert the integers to the alphabets.
- Sort it in lexicographical order.
aia sa aiia sia aecb ocb aaia asa kia
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Python | All possible N combination tuples
- Python - All possible items combination dictionary
- Python - All Position Character Combination
- Count number of strings (made of R, G and B) using given combination
- Python - Smallest integer possible from combination of list elements
- Python - Dictionary values combination of size K
- Python - Character Replacement Combination
- Python - Filter Strings combination of K substrings
- Shortest possible combination of two strings
- Find the resulting Colour Combination
- Python program to print all Strong numbers in given list
- Python Program to print all permutations of a given string
- Print all possible combinations of the string by replacing '$' with any other digit from the string
- Print string after removing all (“10” or “01”) from the binary string
- Given a string and an integer k, find the kth sub-string when all the sub-strings are sorted according to the given condition
- Program to print all the numbers divisible by 3 and 5 for a given number
- Python - Replace all numbers by K in given String
- Write a program to print all permutations of a given string
- Given a string, print all possible palindromic partitions
- Program to print all substrings of a given string
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.