Problem in the Maximal String question on codeforces

I have been trying to solve the problem
But it gives WA in the test case 17. Here is my solution

Even i cant figure out from the test case that why my answer is wrong as the currect answer and my answer looks same.

1 Like

Same issue, output looks same as expected answer

Ididnt understand the question
Take the least of t and append it to u both they are empty strings?
And the answer is u only where is t or case one least of s in string t or sorrrrry
You mean least of s to t the empty string then the least of t to the empty string u is that the meaning of least?

First isn’t it one and only one char
Also last
Means u will get one char each time because it is empty since beginning

1 Like