Given a string s containing lowercase English letters and the character '?', replace every occurrence of '?' with a lowercase English letter such that no two consecutive characters in the resulting string are equal.

You cannot modify characters other than '?'.

Return the final string. If there are multiple valid solutions, return any of them.

Constraints:

• $1 \leq$ s.length $\leq 100$

• s consists of lowercase English letters and '?'.

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.