min number insertion to make string palindrome leetcode.txt

class Solution {
public:

int minInsertions(string s) {
    int n=s.length();
    string revs=s;
    reverse(revs.begin(),revs.end());
    cout<<revs;
    int dp[n+1][n+1];
    memset(dp,0,sizeof(dp));
    
    for(int i=1;i<n+1;i++)
    {
        for(int j=1;j<n+1;j++)
        {
            if(s[i-1]==revs[j-1])
                dp[i][j]=1+dp[i-1][j-1];
            else
                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
        }
    }
    return n-dp[n][n];
}
};