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

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

|1551|[Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1551.java)||Medium|Math|

|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|

packagecom.fishercoder.solutions;

publicclass_1551 {

publicstaticclassSolution1 {

publicintminOperations(intn) {

intmin =1;

intmax =2 * (n -1) +1;

intfinalNumber = (max +min) /2;

int[]arr =newint[n];

for (inti =0;i <n;i++) {

arr[i] =2 *i +1;

}

intops =0;

for (inti =0;i <n /2;i++) {

ops +=finalNumber -arr[i];

}

returnops;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1551;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticjunit.framework.TestCase.assertEquals;

publicclass_1551Test {

privatestatic_1551.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1551.Solution1();

}

publicvoidtest1() {

assertEquals(2,solution1.minOperations(3));

}

}