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

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

|1592|[Rearrange Spaces Between Words](https://leetcode.com/problems/rearrange-spaces-between-words/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1592.java)||String|Easy|

|1588|[Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1588.java)||Array|Easy|

|1583|[Count Unhappy Friends](https://leetcode.com/problems/count-unhappy-friends/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1583.java)||Array|Medium|

|1582|[Special Positions in a Binary Matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1582.java)||Array|Easy|

|1576|[Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1576.java)|[:tv:](https://youtu.be/SJBDLYqrIsM)|String|Easy|

packagecom.fishercoder.solutions;

publicclass_1588 {

publicstaticclassSolution1 {

publicintsumOddLengthSubarrays(int[]arr) {

intsum =0;

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

sum +=arr[i];

}

intlength =3;

while (length <=arr.length) {

for (intj =0;j <=arr.length -length;j++) {

for (inti =j;i <j +length;i++) {

sum +=arr[i];

}

}

length +=2;

}

returnsum;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1588;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticjunit.framework.TestCase.assertEquals;

publicclass_1588Test {

privatestatic_1588.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1588.Solution1();

}

publicvoidtest1() {

assertEquals(58,solution1.sumOddLengthSubarrays(newint[]{1,4,2,5,3}));

}

}