Given a palindromic string of lowercase English letters palindrome, replace exactly $1$ character with any lowercase English letter such that the resulting string is not a palindrome and is the lexicographically smallest possible string.

Return the resulting string. If it is impossible to replace a single character to make the string not a palindrome, return an empty string "".

Constraints:

• $1 \leq$ palindrome.length $\leq 1000$

• palindrome consists of only lowercase English letters.

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.