Given a string of characters of length less than 10. We need to print all the alpha-numeric abbreviation of the string.
The alpha-numeric abbreviation is in the form of characters mixed with the digits which is equal to the number of skipped characters of a selected substring. So, whenever a substring of characters is skipped, you have to replace it with the digit denoting the number of characters in the substring. There may be any number of skipped substrings of a string. No two substrings should be adjacent to each other. Hence, no two digits are adjacent in the result. For a clearer idea, see the example.
Input : ANKS Output : ANKS (nothing is replaced) ANK1 (S is replaced) AN1S (K is replaced) AN2 (KS is replaced) A1KS (N is replaced) A1K1 (N and S are replaced) A2S (NK is replaced) A3 (NKS is replaced) 1NKS (A is replaced) 1NK1 (A and S are replaced) 1N1S (A and N is replaced) 1N2 (A and KS are replaced) 2KS (AN is replaced) 2K1 (AN and S is replaced) 3S (ANK is replaced) 4 (ANKS is replaced) Input : ABC Output : ABC AB1 A1C A2 1BC 1B1 2C 3 Note: 11C is not valid because no two digits should be adjacent, 2C is the correct one because AB is a substring, not A and B individually
Source: Google Interview question
The idea is to start with empty string. At every step, we have two choices.
- Consider character as it is.
- Add character to count. If there is no count, then use 1.
You can see how each character can either add up to the result as a character or as a digit. This further gives rise to 2^n abbreviations at the end where n is the length of string.
GFG GF1 G1G G2 1FG 1F1 2G 3
This article is contributed by Aditya Nihal Kumar Singh. 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 write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Sort an alphanumeric string such that the positions of alphabets and numbers remain unchanged
- String Range Queries to find the number of subsets equal to a given String
- String slicing in Python to check if a string can become empty by recursive deletion
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Lexicographically smallest string formed by appending a character from the first K characters of a given string
- Minimal moves to form a string by adding characters or appending string itself
- Find the longest sub-string which is prefix, suffix and also present inside the string
- Create a new string by alternately combining the characters of two halves of the string in reverse
- Count the nodes of a tree whose weighted string is an anagram of the given string
- Find the count of palindromic sub-string of a string in its sorted form
- Find the character in first string that is present at minimum index in second string
- Minimum deletions from string to reduce it to string with at most 2 unique characters
- Find length of longest subsequence of one string which is substring of another string
- Minimum number of given operations required to convert a string to another 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