Easy Golang Solution
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:\no(n^2) because of (n+1)*(n+1) array.\n\n- Space complexity:\no(n^2) because of (n+1)*(n+1) array.\n\n\n# Code\n```\npackage main\n\nfunc minInsertions(s string) int {\n    n := len(s)\n    dp := make([][]int, n+1)\n    for i := 0; i <= n; i++ {\n        dp[i] = make([]int, n+1)\n    }\n    r := reverse(s)\n    for i := 0; i <= n; i++ {\n        for j := 0; j <= n; j++ {\n            if i == 0 || j == 0 {\n                dp[i][j] = 0\n            } else if s[i-1] == r[j-1] {\n                dp[i][j] = dp[i-1][j-1] + 1\n            } else {\n                dp[i][j] = max(dp[i-1][j], dp[i][j-1])\n            }\n        }\n    }\n    return n - dp[n][n]\n}\n\nfunc reverse(s string) string {\n    n := len(s)\n    r := make([]byte, n)\n    for i := 0; i < n; i++ {\n        r[i] = s[n-i-1]\n    }\n    return string(r)\n}\n\nfunc max(a, b int) int {\n    if a > b {\n        return a\n    }\n    return b\n}\n\n```
['Brainteaser', 'Go']