solves detect pattern of length m repeated k or more times

Author: anishLearnsToCode

README.md

@@ -392,3 +392,4 @@
 | 1550 | [Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds)                                                                       |                                                              [![Java](assets/java.png)](src/ThreeConsecutiveOdds.java)                                                               |                                                                                                                                   |
 | 1556 | [Thousand Separator](https://leetcode.com/problems/thousand-separator)                                                                               |                                                                [![Java](assets/java.png)](src/ThousandSeparator.java)                                                                |                                                                                                                                   |
 | 1560 | [Most Visited Sector in a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track)                                     |                                                        [![Java](assets/java.png)](src/MostVisitedSectorInACircularTrack.java)                                                        |                                                                                                                                   |
+| 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)             |                                                   [![Java](assets/java.png)](src/DetectPatternOfLengthMRepeatedKOrMoreTimes.java)                                                    |                                                                                                                                   |

src/DetectPatternOfLengthMRepeatedKOrMoreTimes.java

@@ -0,0 +1,35 @@
+// https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times
+// T: O(nm^2k)
+// s: O(1)
+
+public class DetectPatternOfLengthMRepeatedKOrMoreTimes {
+    public boolean containsPattern(int[] arr, int m, int k) {
+        if (m * k > arr.length || m > arr.length) return false;
+        if (k == 1) return true;
+
+        for (int i = 0 ; i < arr.length - m * k + 1 ; i++) {
+            if (consistsOfPattern(arr, i, m, k)) {
+                return true;
+            }
+        }
+        return false;
+    }
+
+    private boolean consistsOfPattern(int[] array, int startIndex, int patternLen, int k) {
+        for (int j = startIndex + patternLen ; j <= startIndex + (k - 1) * patternLen ; j += patternLen) {
+            if (!arrayIsSame(array, startIndex, j, patternLen)) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+    private boolean arrayIsSame(int[] array, int i, int j, int patternLen) {
+        for (int k = 0 ; k < patternLen ; k++) {
+            if (array[i + k] != array[j + k]) {
+                return false;
+            }
+        }
+        return true;
+    }
+}