Given an integer n, return a string of length n such that every character in the string appears an odd number of times.

The returned string must consist solely of lowercase English letters. If there are multiple valid strings, you may return any of them.

Constraints:

• $1 \leq$ n $\leq 500$

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.