Problem of the day
‘S’ = “112”.
Output: [aab, al, kb]
The possible ways to convert the given strings is:
aab => a = 1, a = 1, b = 2,
al => a = 1, l = 12
kb => k = 11, b = 2
Hence, the final array is: [aab, al, kb].
The first line will contain the integer 'T', denoting the number of test cases.
The first line of each test case contains a string ‘S’.
For each test case, you don’t need to print anything just return an array of all possible strings sorted in non-decreasing lexicographical order.
You don't need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 10
1 <= S.length <= 20
Sum of length of strings over all test cases <= 20
Time Limit: 1 sec
2
1123
125
aabc aaw alc kbc kw
abe ay le
For the first case:
aabc => a=1, a=1, b=2, c=3
aaw => a=1, a=1, w=23
alc => a=1, l=12, c=3
kbc => k=11, b=2, c=3
kw => k=11, w=23
Sorting the strings in lexicographical order, so the final output is [aabc, aaw, alc, kbc, kw].
For the second case:
abe => a=1, b=2, e=5
le => l=12, e=5
Sorting the strings in lexicographical order, the final output is [abe le].
2
721023
871121
gbjbc gbjw
hgaaba hgaau hgala hgkba hgku