Easy cpp solution
\n\n# Code\n\n#include <string>\n#include <algorithm>\n\nclass Solution {\npublic:\n    string makeSmallestPalindrome(string str) {\n        int start = 0;\n   
\n\n# Code\n```\n#include <string>\n#include <algorithm>\n\nclass Solution {\npublic:\n    string makeSmallestPalindrome(string str) {\n        int start = 0;\n        int end = str.length() - 1;\n        char ch[str.length()];\n        copy(str.begin(), str.end(), ch);\n        \n        while (start <= end) {\n            if (ch[start] == ch[end]) {\n                start++;\n                end--;\n            } else {\n                int inder = ch[start] - \'0\';\n                int jeet = ch[end] - \'0\';\n                if (inder > jeet) {\n                    ch[start] = ch[end];\n                } else {\n                    ch[end] = ch[start];\n                }\n                \n                start++;\n                end--;\n            }\n        }\n        \n        return string(ch, str.length());\n    }\n};\n\n```
['C++']