✅  Java | Naive Recursion - Brute Force Approach
\n// Approach 1: Naive Recursion (Brute Force Approach) - TLE\n\n// Time complexity: O(2^n)\n// Space complexity: O(2^n)\n\nclass Solution {\n    public int min
```\n// Approach 1: Naive Recursion (Brute Force Approach) - TLE\n\n// Time complexity: O(2^n)\n// Space complexity: O(2^n)\n\nclass Solution {\n    public int minInsertions(String s) {\n        return lcs(s, 0, s.length() - 1);    \n    }\n    \n    private int lcs(String s, int left, int right) {\n        if (left > right)\n            return 0;\n        \n        if (s.charAt(left) == s.charAt(right))\n            return lcs(s, left + 1, right - 1);\n        \n        return 1 + Math.min(lcs(s, left + 1, right), lcs(s, left, right - 1));\n    }\n}\n```\n\n**Please upvote if you find this solution useful. Happy Coding!**
['Recursion', 'Java']