Leetcode 2697. Lexicographically Smallest Palindrome

Given a lowercase string, make the minimum number of character replacements to turn it into a palindrome and, among all such minimal-change palindromes, return the lexicographically smallest one. Key idea: handle each mirrored pair independently—when characters differ, replace them with the smaller letter.