<p>Given two strings <code>s1</code> and&nbsp;<code>s2</code>, return <em>the lowest <strong>ASCII</strong> sum of deleted characters to make two strings equal</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s1 = &quot;sea&quot;, s2 = &quot;eat&quot;
<strong>Output:</strong> 231
<strong>Explanation:</strong> Deleting &quot;s&quot; from &quot;sea&quot; adds the ASCII value of &quot;s&quot; (115) to the sum.
Deleting &quot;t&quot; from &quot;eat&quot; adds 116 to the sum.
At the end, both strings are equal, and 115 + 116 = 231 is the minimum sum possible to achieve this.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s1 = &quot;delete&quot;, s2 = &quot;leet&quot;
<strong>Output:</strong> 403
<strong>Explanation:</strong> Deleting &quot;dee&quot; from &quot;delete&quot; to turn the string into &quot;let&quot;,
adds 100[d] + 101[e] + 101[e] to the sum.
Deleting &quot;e&quot; from &quot;leet&quot; adds 101[e] to the sum.
At the end, both strings are equal to &quot;let&quot;, and the answer is 100+101+101+101 = 403.
If instead we turned both strings into &quot;lee&quot; or &quot;eet&quot;, we would get answers of 433 or 417, which are higher.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s1.length, s2.length &lt;= 1000</code></li>
	<li><code>s1</code> and <code>s2</code> consist of lowercase English letters.</li>
</ul>

class Solution {
public:
int ascii(string s){
    int sum=0;
    for(int i=0;i<s.length();i++){
        sum=sum+int(s[i]);
    }
    return sum;
}

int lcs(string &s1,string &s2,int index1,int index2,vector<vector<int>>&dp){
     if(index1>=s1.length() || index2>=s2.length()){
       return 0;
     }
 if(dp[index1][index2]!=-1){
    return dp[index1][index2];
 }

if(s1[index1]==s2[index2]){
    string r="";
    r.push_back(s1[index1]);
    return  dp[index1][index2] =ascii(r)+lcs(s1,s2,index1+1,index2+1,dp);
}
int x=lcs(s1,s2,index1+1,index2,dp);
int y=lcs(s1,s2,index1,index2+1,dp);
if(x>y){
    return dp[index1][index2]= x;
}
return  dp[index1][index2] = y;

}
    int minimumDeleteSum(string s1, string s2) {
       vector<vector<int>>dp(s1.length(),vector<int>(s2.length(),-1));
        int x=lcs(s1, s2,0,0,dp);
        cout<<x;
        
        return ascii(s1)+ascii(s2)-2*x;
    }
};
19200