Given two integers a and b, return any valid string s such that:

• s contains exactly a occurrences of the letter 'a' and b occurrences of the letter 'b'.

• The substring 'aaa' does not appear in s.

• The substring 'bbb' does not appear in s.

Constraints:

• $0 \le a, b \le 100$

• It is guaranteed that such a string s exists for the given a and b.

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.