Add solution #1023

Author: JoshCrozier

README.md

@@ -299,6 +299,7 @@
 1009|[Complement of Base 10 Integer](./1009-complement-of-base-10-integer.js)|Easy|
 1010|[Pairs of Songs With Total Durations Divisible by 60](./1010-pairs-of-songs-with-total-durations-divisible-by-60.js)|Medium|
 1022|[Sum of Root To Leaf Binary Numbers](./1022-sum-of-root-to-leaf-binary-numbers.js)|Easy|
+1023|[Camelcase Matching](./1023-camelcase-matching.js)|Medium|
 1037|[Valid Boomerang](./1037-valid-boomerang.js)|Easy|
 1041|[Robot Bounded In Circle](./1041-robot-bounded-in-circle.js)|Medium|
 1047|[Remove All Adjacent Duplicates In String](./1047-remove-all-adjacent-duplicates-in-string.js)|Easy|

solutions/1023-camelcase-matching.js

@@ -0,0 +1,21 @@
+/**
+ * 1023. Camelcase Matching
+ * https://leetcode.com/problems/camelcase-matching/
+ * Difficulty: Medium
+ *
+ * Given an array of strings queries and a string pattern, return a boolean array answer
+ * where answer[i] is true if queries[i] matches pattern, and false otherwise.
+ *
+ * A query word queries[i] matches pattern if you can insert lowercase English letters
+ * pattern so that it equals the query. You may insert each character at any position
+ * and you may not insert any characters.
+ */
+
+/**
+ * @param {string[]} queries
+ * @param {string} pattern
+ * @return {boolean[]}
+ */
+var camelMatch = function(queries, pattern) {
+  return queries.map(s => s.match(pattern.split(/(.)/).join('[a-z]*'))?.at(0) === s);
+};