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

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

|1574|[Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1574.java)||Array, Binary Search|Medium|

|1572|[Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1572.java)||Array|Easy|

|1567|[Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1567.java)|[:tv:](https://youtu.be/bFer5PdsgpY)|Greedy|Medium|

|1566|[Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1566.java)|[:tv:](https://youtu.be/aJAV_VgmjdE)|Array|Easy|

packagecom.fishercoder.solutions;

publicclass_1574 {

publicstaticclassSolution1 {

publicintfindLengthOfShortestSubarray(int[]arr) {

intleft =0;

while (left <arr.length -1 &&arr[left] <=arr[left +1]) {

left++;

}

if (left ==arr.length -1) {

return0;

}

intright =arr.length -1;

while (right >left &&arr[right] >=arr[right -1]) {

right--;

}

if (right ==0) {

returnarr.length -1;

}

intresult =Math.min(arr.length -left -1,right);

inti =0;

intj =right;

while (i <=left &&j <arr.length) {

if (arr[j] >=arr[i]) {

result =Math.min(result,j -i -1);

i++;

}else {

j++;

}

}

returnresult;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1574;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticjunit.framework.TestCase.assertEquals;

publicclass_1574Test {

privatestatic_1574.Solution1solution1;

privatestaticint[]arr;

publicstaticvoidsetup() {

solution1 =new_1574.Solution1();

}

publicvoidtest1() {

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

assertEquals(3,solution1.findLengthOfShortestSubarray(arr));

}

}