leetcode 2697. Lexicographically Smallest Palindrome

https://leetcode.com/problems/lexicographically-smallest-palindrome/description/

 

class Solution:
    def makeSmallestPalindrome(self, s: str) -> str:
        s = list(s)
        for i in range(len(s)//2):
            if s[i] != s[-(i+1)]:
                if s[i] < s[-(i+1)]:
                    s[-(i+1)] = s[i]
                else:
                    s[i] = s[-(i+1)]
        
        return ''.join(s)