Java | Easy solution | 8 lines
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: $$O(n)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(n)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n  public String makeSmallestPalindrome(String s) {\n    var c = s.toCharArray();\n    int i = 0, j = c.length - 1;\n    \n    while (i < j) {\n      if (c[i] < c [j])\n        c[j--] = c[i++];\n      else\n        c[i++] = c[j--];\n    }\n    return new String(c);\n  }\n}\n```\nIf you like my solution, please upvote it!
['Java']