Leetcode 1328. Break a Palindrome

Given a palindromic lowercase string, change exactly one character to produce the lexicographically smallest string that is not a palindrome (or return empty if impossible). The core challenge is using the string's symmetry to choose the single replacement that yields the smallest lexicographic change while handling short-edge cases.