2025-08-21 12:32:49 +0000 UTC
Lexicographically Smallest Palindrome
Categories:
Links
Code
class Solution:
def makeSmallestPalindrome(self, s: str) -> str:
letters = list(s)
for i in range(len(s) // 2):
letters[i] = letters[~i] = min(letters[i], letters[~i])
return ''.join(letters)