Add solution #1461

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,313 LeetCode solutions in JavaScript
+# 1,314 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1116,6 +1116,7 @@
 1457|[Pseudo-Palindromic Paths in a Binary Tree](./solutions/1457-pseudo-palindromic-paths-in-a-binary-tree.js)|Medium|
 1458|[Max Dot Product of Two Subsequences](./solutions/1458-max-dot-product-of-two-subsequences.js)|Hard|
 1460|[Make Two Arrays Equal by Reversing Sub-arrays](./solutions/1460-make-two-arrays-equal-by-reversing-sub-arrays.js)|Easy|
+1461|[Check If a String Contains All Binary Codes of Size K](./solutions/1461-check-if-a-string-contains-all-binary-codes-of-size-k.js)|Medium|
 1462|[Course Schedule IV](./solutions/1462-course-schedule-iv.js)|Medium|
 1464|[Maximum Product of Two Elements in an Array](./solutions/1464-maximum-product-of-two-elements-in-an-array.js)|Easy|
 1466|[Reorder Routes to Make All Paths Lead to the City Zero](./solutions/1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.js)|Medium|

solutions/1461-check-if-a-string-contains-all-binary-codes-of-size-k.js

@@ -0,0 +1,25 @@
+/**
+ * 1461. Check If a String Contains All Binary Codes of Size K
+ * https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/
+ * Difficulty: Medium
+ *
+ * Given a binary string s and an integer k, return true if every binary code of length k is a
+ * substring of s. Otherwise, return false.
+ */
+
+/**
+ * @param {string} s
+ * @param {number} k
+ * @return {boolean}
+ */
+var hasAllCodes = function(s, k) {
+  const requiredCount = 1 << k;
+  const seenCodes = new Set();
+
+  for (let i = 0; i <= s.length - k; i++) {
+    seenCodes.add(s.slice(i, i + k));
+    if (seenCodes.size === requiredCount) return true;
+  }
+
+  return false;
+};