You are given an integer array nums.

For each element nums[i], consider an initial string formed by repeating the character 'a' exactly nums[i] times.

You can repeatedly apply the following transformation:
Choose two occurrences of the same character and replace them with the single next character in the English alphabet (for example, replace two 'a' characters with one 'b', two 'b' characters with one 'c', and so on).

Return an array of strings where the $i^{ ext{th}}$ string is the lexicographically largest string that can be obtained from the string corresponding to nums[i] after applying the transformation as many times as possible.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^8$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.