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

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

|1550|[Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1550.java)||Easy|Array|

|1545|[Find Kth Bit in Nth Binary String](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1545.java)||Medium|String|

|1544|[Make The String Great](https://leetcode.com/problems/make-the-string-great/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1544.java)||Easy|String, Stack|

|1541|[Minimum Insertions to Balance a Parentheses String](https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1541.java)||Medium|String, Stack|

packagecom.fishercoder.solutions;

publicclass_1550 {

publicstaticclassSolution1 {

publicbooleanthreeConsecutiveOdds(int[]arr) {

for (inti =0;i <arr.length -2;i++) {

if (arr[i] %2 ==1 &&arr[i +1] %2 ==1 &&arr[i +2] %2 ==1) {

returntrue;

}

}

returnfalse;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1550;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticjunit.framework.TestCase.assertEquals;

publicclass_1550Test {

privatestatic_1550.Solution1solution1;

privatestaticint[]arr;

publicstaticvoidsetup() {

solution1 =new_1550.Solution1();

}

publicvoidtest1() {

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

assertEquals(false,solution1.threeConsecutiveOdds(arr));

}

}