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

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

|1535|[Find the Winner of an Array Game](https://leetcode.com/problems/find-the-winner-of-an-array-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1535.java)||Medium|Array|

|1534|[Count Good Triplets](https://leetcode.com/problems/count-good-triplets/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1534.java)||Easy|Array|

|1528|[Shuffle String](https://leetcode.com/problems/shuffle-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1528.java)||Easy|Sort|

|1526|[Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1526.java)||Hard|Segment Tree|

packagecom.fishercoder.solutions;

publicclass_1535 {

publicstaticclassSolution1 {

publicintgetWinner(int[]arr,intk) {

intwinner =arr[0];

intwinTimes =0;

for (inti =1;i <arr.length;i++) {

if (arr[i] >winner) {

winner =arr[i];

winTimes =1;

}else {

winTimes++;

}

if (winTimes >=k) {

returnwinner;

}

}

returnwinner;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1535;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticjunit.framework.TestCase.assertEquals;

publicclass_1535Test {

privatestatic_1535.Solution1solution1;

privatestaticint[]arr;

publicstaticvoidsetup() {

solution1 =new_1535.Solution1();

}

publicvoidtest1() {

arr =newint[]{2,1,3,5,4,6,7};

assertEquals(5,solution1.getWinner(arr,2));

}

publicvoidtest2() {

arr =newint[]{1,11,22,33,44,55,66,77,88,99};

assertEquals(99,solution1.getWinner(arr,100));

}

publicvoidtest3() {

arr =newint[]{1,9,8,2,3,7,6,4,5};

assertEquals(9,solution1.getWinner(arr,7));

}

}