Add solution #1208

Author: JoshCrozier

README.md

@@ -323,6 +323,7 @@
 1122|[Relative Sort Array](./1122-relative-sort-array.js)|Easy|
 1189|[Maximum Number of Balloons](./1189-maximum-number-of-balloons.js)|Easy|
 1207|[Unique Number of Occurrences](./1207-unique-number-of-occurrences.js)|Easy|
+1208|[Get Equal Substrings Within Budget](./1208-get-equal-substrings-within-budget.js)|Medium|
 1217|[Minimum Cost to Move Chips to The Same Position](./1217-minimum-cost-to-move-chips-to-the-same-position.js)|Easy|
 1232|[Check If It Is a Straight Line](./1232-check-if-it-is-a-straight-line.js)|Easy|
 1233|[Remove Sub-Folders from the Filesystem](./1233-remove-sub-folders-from-the-filesystem.js)|Medium|

solutions/1208-get-equal-substrings-within-budget.js

@@ -0,0 +1,35 @@
+/**
+ * 1208. Get Equal Substrings Within Budget
+ * https://leetcode.com/problems/get-equal-substrings-within-budget/
+ * Difficulty: Medium
+ *
+ * You are given two strings s and t of the same length and an integer maxCost.
+ *
+ * You want to change s to t. Changing the ith character of s to ith character of t costs
+ * |s[i] - t[i]| (i.e., the absolute difference between the ASCII values of the characters).
+ *
+ * Return the maximum length of a substring of s that can be changed to be the same as the
+ * corresponding substring of t with a cost less than or equal to maxCost. If there is no
+ * substring from s that can be changed to its corresponding substring from t, return 0.
+ */
+
+/**
+ * @param {string} s
+ * @param {string} t
+ * @param {number} maxCost
+ * @return {number}
+ */
+var equalSubstring = function(s, t, maxCost) {
+  let left = -1;
+
+  for (let right = 0; right < s.length; right++) {
+    maxCost -= Math.abs(s.charCodeAt(right) - t.charCodeAt(right));
+
+    if (maxCost < 0) {
+      left++;
+      maxCost += Math.abs(s.charCodeAt(left) - t.charCodeAt(left));
+    }
+  }
+
+  return s.length - left - 1;
+};