Add solution #44

Author: JoshCrozier

README.md

@@ -49,6 +49,7 @@
 41|[First Missing Positive](./0041-first-missing-positive.js)|Hard|
 42|[Trapping Rain Water](./0042-trapping-rain-water.js)|Hard|
 43|[Multiply Strings](./0043-multiply-strings.js)|Medium|
+44|[Wildcard Matching](./0044-wildcard-matching.js)|Hard|
 45|[Jump Game II](./0045-jump-game-ii.js)|Medium|
 46|[Permutations](./0046-permutations.js)|Medium|
 47|[Permutations II](./0047-permutations-ii.js)|Medium|

solutions/0044-wildcard-matching.js

@@ -0,0 +1,50 @@
+/**
+ * 44. Wildcard Matching
+ * https://leetcode.com/problems/wildcard-matching/
+ * Difficulty: Hard
+ *
+ * Given an input string (s) and a pattern (p), implement wildcard pattern
+ * matching with support for '?' and '*' where:
+ *
+ * - '?' Matches any single character.
+ * - '*' Matches any sequence of characters (including the empty sequence).
+ *
+ * The matching should cover the entire input string (not partial).
+ */
+
+/**
+ * @param {string} s
+ * @param {string} p
+ * @return {boolean}
+ */
+var isMatch = function(s, p) {
+  let i = 0;
+  let j = 0;
+  let start = -1;
+  let offset = -1;
+
+  while (i < s.length) {
+    if (j < p.length && s[i] === p[j] || p[j] === '?') {
+      i++;
+      j++;
+    } else if (j < p.length && p[j] === '*') {
+      start = j;
+      offset = i;
+      j++;
+    } else if (start === -1) {
+      return false;
+    } else {
+      j = start + 1;
+      i = offset + 1;
+      offset = i;
+    }
+  }
+
+  for (let index = j; index < p.length; index++) {
+    if (p[index] !== '*') {
+      return false;
+    }
+  }
+
+  return true;
+};