Given a string s consisting of lowercase English letters, you are allowed to perform operations where you replace any character in s with any lowercase English letter.

Find the lexicographically smallest palindrome that can be obtained using the minimum number of operations.

Return the resulting palindrome string.

Constraints:

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

• s 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.