Lexicographical order is often known as alphabetical order when dealing with strings. A string is greater than another string if it comes later in a lexicographically sorted list.
Given a word, create a new word by swapping some or all of its characters. This new word must meet two criteria:
- It must be greater than the original word
- It must be the smallest word that meets the first condition
Example
The next largest word is .
Complete the function biggerIsGreater below to create and return the new string meeting the criteria. If it is not possible, return no answer.
Function Description
Complete the biggerIsGreater function in the editor below.
biggerIsGreater has the following parameter(s):
- string w: a word
Returns
- string: the smallest lexicographically higher string possible or no answer
Input Format
The first line of input contains , the number of test cases.
Each of the next lines contains .
Constraints
- will contain only letters in the range ascii[a..z].
Sample Input 0
5
ab
bb
hefg
dhck
dkhc
Sample Output 0
ba
no answer
hegf
dhkc
hcdk
Explanation 0
- Test case 1:
bais the only string which can be made by rearrangingab. It is greater. - Test case 2:
It is not possible to rearrangebband get a greater string. - Test case 3:
hegfis the next string greater thanhefg. - Test case 4:
dhkcis the next string greater thandhck. - Test case 5:
hcdkis the next string greater thandkhc.
Sample Input 1
6
lmno
dcba
dcbb
abdc
abcd
fedcbabcd
Sample Output 1
lmon
no answer
no answer
acbd
abdc
fedcbabdc