Create README - LeetHub

Author: JanaSabuj

Diff for: minimum-ascii-delete-sum-for-two-strings/README.md

@@ -0,0 +1,25 @@
+<h2>712. Minimum ASCII Delete Sum for Two Strings</h2><h3>Medium</h3><hr><div><p>Given two strings <code>s1, s2</code>, find the lowest ASCII sum of deleted characters to make two strings equal.</p>
+
+<p><b>Example 1:</b><br>
+</p><pre><b>Input:</b> s1 = "sea", s2 = "eat"
+<b>Output:</b> 231
+<b>Explanation:</b> Deleting "s" from "sea" adds the ASCII value of "s" (115) to the sum.
+Deleting "t" from "eat" 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></p>
+
+<p><b>Example 2:</b><br>
+</p><pre><b>Input:</b> s1 = "delete", s2 = "leet"
+<b>Output:</b> 403
+<b>Explanation:</b> Deleting "dee" from "delete" to turn the string into "let",
+adds 100[d]+101[e]+101[e] to the sum.  Deleting "e" from "leet" adds 101[e] to the sum.
+At the end, both strings are equal to "let", and the answer is 100+101+101+101 = 403.
+If instead we turned both strings into "lee" or "eet", we would get answers of 433 or 417, which are higher.
+</pre>
+<p></p>
+
+<p><b>Note:</b>
+</p><li><code>0 &lt; s1.length, s2.length &lt;= 1000</code>.</li>
+<li>All elements of each string will have an ASCII value in <code>[97, 122]</code>.</li> 
+<p></p></div>