_1566.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.Arrays;

publicclass_1566 {
publicstaticclassSolution1 {
publicbooleancontainsPattern(int[] arr, intm, intk) {
for (inti = 0; i < arr.length - m; i++) {
int[] pattern = Arrays.copyOfRange(arr, i, i + m);
inttimes = 1;
for (intj = i + m; j < arr.length; j += m) {
int[] candidate = Arrays.copyOfRange(arr, j, j + m);
if (Arrays.equals(pattern, candidate)) {
times++;
if (times == k) {
returntrue;
 }
 } else {
break;
 }
 }
 }
returnfalse;
 }
 }
}