Sponsored
Sponsored
Use these hints if you're stuck. Try solving on your own first.
We can make any string a palindrome, by simply making any character at index i equal to the character at index length - i - 1 (using 0-based indexing).
To make it lexicographically smallest we can change the character with maximum ASCII value to the one with minimum ASCII value.
Solve with full IDE support and test cases