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

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

|1446|[Consecutive Characters](https://leetcode.com/problems/consecutive-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1446.java)||Easy|String|

|1441|[Build an Array With Stack Operations](https://leetcode.com/problems/build-an-array-with-stack-operations/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1441.java)||Easy|Stack|

|1437|[Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1437.java)||Medium|Array|

|1436|[Destination City](https://leetcode.com/problems/destination-city/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1436.java)||Easy|String|

packagecom.fishercoder.solutions;

publicclass_1446 {

publicstaticclassSolution1 {

publicintmaxPower(Strings) {

intmax =0;

for (inti =0;i <s.length();i++) {

intstart =i;

while (i +1 <s.length() &&s.charAt(i) ==s.charAt(i +1)) {

i++;

}

max =Math.max(max,i -start +1);

}

returnmax;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1446;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticjunit.framework.TestCase.assertEquals;

publicclass_1446Test {

privatestatic_1446.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1446.Solution1();

}

publicvoidtest1() {

assertEquals(2,solution1.maxPower("leetcode"));

}

}