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

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

| 3349|[Adjacent Increasing Subarrays Detection I](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3349.java)|| Easy|

| 3340|[Check Balanced String](https://leetcode.com/problems/check-balanced-string/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3340.java)|| Easy|

| 3330|[Find the Original Typed String I](https://leetcode.com/problems/find-the-original-typed-string-i/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3330.java)|| Easy|

| 3324|[Find the Sequence of Strings Appeared on the Screen](https://leetcode.com/problems/find-the-sequence-of-strings-appeared-on-the-screen/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3324.java)|| Easy|

packagecom.fishercoder.solutions.fourththousand;

importjava.util.List;

publicclass_3349 {

publicstaticclassSolution1 {

publicbooleanhasIncreasingSubarrays(List<Integer>nums,intk) {

for (inti =0;i <nums.size();i++) {

intcount =1;

intj =i;

booleanpossible =true;

for (;j +1 <nums.size() &&count++ <k;j++) {

if (nums.get(j +1) <=nums.get(j)) {

possible =false;

break;

}

}

booleanpossibleAgain =true;

j++;

if (possible) {

count =1;

for (;j +1 <nums.size() &&count++ <k;j++) {

if (nums.get(j +1) <=nums.get(j)) {

possibleAgain =false;

break;

}

}

if (count <k) {

possibleAgain =false;

}

if (possibleAgain) {

returntrue;

}

}

}

returnfalse;

}

}

}

packagecom.fishercoder.fourththousand;

importcom.fishercoder.solutions.fourththousand._3349;

importorg.junit.jupiter.api.BeforeEach;

importorg.junit.jupiter.api.Test;

importjava.util.Arrays;

importstaticorg.junit.jupiter.api.Assertions.assertFalse;

importstaticorg.junit.jupiter.api.Assertions.assertTrue;

publicclass_3349Test {

private_3349.Solution1solution1;

publicvoidsetup() {

solution1 =new_3349.Solution1();

}

publicvoidtest1() {

assertTrue(solution1.hasIncreasingSubarrays(Arrays.asList(2,5,7,8,9,2,3,4,3,1),3));

}

publicvoidtest2() {

assertFalse(solution1.hasIncreasingSubarrays(Arrays.asList(1,2,3,4,4,4,4,5,6,7),5));

}

publicvoidtest3() {

assertTrue(solution1.hasIncreasingSubarrays(Arrays.asList(5,8, -2, -1),2));

}

}