There is a string of length N made only of letters $"$a$".$ Whenever there are two identical adjacent letters $($e$.$g$."$aa$"),$ they can be transformed into a single letter that is the next letter of the alphabet. For example, $"$aa$"$ can be transformed into $"$b$"$ and $"$ee$"$ into $"$f$".$ However, $"$zz$"$ cannot be further transformed.

What is the alphabetically largest string that can be obtained from the initial string?

Write a function:

class Solution & public String solution$($int N$)$:

Files

task$1$

solution.java test$-$input.txt

SO

$1$

$2$

$8$

$9$

$10$

$11$

$12$

that, given an integer N$,$ returns the alphabetically largest string that can be obtained after such transformations.

Examples:

$1.$ Given N $=11,$ the function should return "aba". The initial string

"aaaaaaaaaaa" can be transformed in the following manner:

'aaaaaaaaaaa" $->$ "bbbbba"$>$ ccba"$->$ "dba"