Add solution #712

Author: JoshCrozier

0712-minimum-ascii-delete-sum-for-two-strings.js

@@ -0,0 +1,41 @@
+/**
+ * 712. Minimum ASCII Delete Sum for Two Strings
+ * https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/
+ * Difficulty: Medium
+ *
+ * Given two strings s1 and s2, return the lowest ASCII sum of deleted characters to
+ * make two strings equal.
+ */
+
+/**
+ * @param {string} s1
+ * @param {string} s2
+ * @return {number}
+ */
+var minimumDeleteSum = function(s1, s2) {
+  const dp = new Array(s1.length + 1).fill().map(() => {
+    return new Array(s2.length + 1).fill(0);
+  });
+
+  for (let i = 1; i <= s1.length; i++) {
+    dp[i][0] = dp[i - 1][0] + s1.charCodeAt(i - 1);
+  }
+  for (let j = 1; j <= s2.length; j++) {
+    dp[0][j] = dp[0][j - 1] + s2.charCodeAt(j - 1);
+  }
+
+  for (let i = 1; i <= s1.length; i++) {
+    for (let j = 1; j <= s2.length; j++) {
+      if (s1[i - 1] === s2[j - 1]) {
+        dp[i][j] = dp[i - 1][j - 1];
+      } else {
+        dp[i][j] = Math.min(
+          dp[i - 1][j] + s1.charCodeAt(i - 1),
+          dp[i][j - 1] + s2.charCodeAt(j - 1)
+        );
+      }
+    }
+  }
+
+  return dp[s1.length][s2.length];
+};

README.md

@@ -537,6 +537,7 @@
 706|[Design HashMap](./0706-design-hashmap.js)|Easy|
 707|[Design Linked List](./0707-design-linked-list.js)|Medium|
 710|[Random Pick with Blacklist](./0710-random-pick-with-blacklist.js)|Hard|
+712|[Minimum ASCII Delete Sum for Two Strings](./0712-minimum-ascii-delete-sum-for-two-strings.js)|Medium|
 713|[Subarray Product Less Than K](./0713-subarray-product-less-than-k.js)|Medium|
 714|[Best Time to Buy and Sell Stock with Transaction Fee](./0714-best-time-to-buy-and-sell-stock-with-transaction-fee.js)|Medium|
 717|[1-bit and 2-bit Characters](./0717-1-bit-and-2-bit-characters.js)|Easy|