Two pointer Approach only EASY TO UNDERSTAND
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    string makeSmallestPalindrome(string s) {\n        string p = s;\n    int left = 0;\n    int r = s.length() - 1;\n\n    while (left < r) {\n        if (p[left] != p[r]) {\n            p[r] = p[left] = std::min(p[left], p[r]);\n        }\n        left++;\n        r--;\n    }\n\n    return p;\n        \n    }\n};\n```
['Python', 'C++', 'Java', 'Python3', 'MS SQL Server']