Add solution #1566

Author: JoshCrozier

README.md

@@ -186,6 +186,7 @@
 1507|[Reformat Date](./1507-reformat-date.js)|Easy|
 1550|[Three Consecutive Odds](./1550-three-consecutive-odds.js)|Easy|
 1551|[Minimum Operations to Make Array Equal](./1551-minimum-operations-to-make-array-equal.js)|Medium|
+1566|[Detect Pattern of Length M Repeated K or More Times](./1566-detect-pattern-of-length-m-repeated-k-or-more-times.js)|Easy|
 1598|[Crawler Log Folder](./1598-crawler-log-folder.js)|Easy|
 1668|[Maximum Repeating Substring](./1668-maximum-repeating-substring.js)|Easy|
 1780|[Check if Number is a Sum of Powers of Three](./1780-check-if-number-is-a-sum-of-powers-of-three.js)|Medium|

solutions/1566-detect-pattern-of-length-m-repeated-k-or-more-times.js

@@ -0,0 +1,28 @@
+/**
+ * 1566. Detect Pattern of Length M Repeated K or More Times
+ * https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/
+ * Difficulty: Easy
+ *
+ * Given an array of positive integers arr, find a pattern of length m that is repeated k or more times.
+ *
+ * A pattern is a subarray (consecutive sub-sequence) that consists of one or more values, repeated multiple
+ * times consecutively without overlapping. A pattern is defined by its length and the number of repetitions.
+ *
+ * Return true if there exists a pattern of length m that is repeated k or more times, otherwise return false.
+ */
+
+/**
+ * @param {number[]} arr
+ * @param {number} m
+ * @param {number} k
+ * @return {boolean}
+ */
+var containsPattern = function(arr, m, k) {
+  for (let i = 0; i < arr.length - m + 1; i++) {
+    const pattern = new Array(k).fill(arr.slice(i, i + m).join()).join();
+    if (arr.join().includes(pattern)) {
+      return true;
+    }
+  }
+  return false;
+};