| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|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/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1566.java)||Array|Easy|

|1561|[Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1561.java)|[:tv:](https://youtu.be/hPe9Z3TiUrA)|Sort|Medium|

|1560|[Most Visited Sector in a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1560.java)||Array|Easy|

|1558|[Minimum Numbers of Function Calls to Make Target Array](https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1558.java)||Medium|Greedy|

packagecom.fishercoder.solutions;

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;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1566;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1566Test {

privatestatic_1566.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1566.Solution1();

}

publicvoidtest1() {

assertEquals(true,solution1.containsPattern(newint[]{1,2,4,4,4,4},1,3));

}

publicvoidtest2() {

assertEquals(true,solution1.containsPattern(newint[]{1,2,1,2,1,1,1,3},2,2));

}

publicvoidtest3() {

assertEquals(false,solution1.containsPattern(newint[]{1,2,1,2,1,3},2,3));

}

publicvoidtest4() {

assertEquals(false,solution1.containsPattern(newint[]{1,2,3,1,2},2,2));

}

publicvoidtest5() {

assertEquals(true,solution1.containsPattern(newint[]{1,2,4,4,4,4},1,3));

}

publicvoidtest6() {

assertEquals(false,solution1.containsPattern(newint[]{2,2,2,2},2,3));

}

publicvoidtest7() {

assertEquals(false,solution1.containsPattern(newint[]{2,2,1,2,2,1,1,1,2,1},2,2));

}

}