4 ms Beats 62.22%
IntuitionApproachComplexity
Time complexity:O(N)

Space complexity:O(1)
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:O(N)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:O(1)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);
class Solution {
public:
    string makeSmallestPalindrome(string s) {
        fast
        for(int i=0;i<s.length()/2;i++)
        {
            if(s[i]==s[s.length()-i-1])
                continue;
            if(s[i]<s[s.length()-i-1])
                s[s.length()-i-1]=s[i];
            if(s[i]>s[s.length()-i-1])
                s[i]=s[s.length()-i-1];
        }
        return s;
    }
};
```
['C++']