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

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

| 3254|[Find the Power of K-Size Subarrays I](https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3254.java)|| Easy|

| 3249|[Count the Number of Good Nodes](https://leetcode.com/problems/count-the-number-of-good-nodes/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3249.java)|| Medium|

| 3248|[Snake in Matrix](https://leetcode.com/problems/snake-in-matrix/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3248.java)|| Easy|

| 3243|[Shortest Distance After Road Addition Queries I](https://leetcode.com/problems/shortest-distance-after-road-addition-queries-i/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3243.java)|| Medium|

packagecom.fishercoder.solutions.fourththousand;

importjava.util.Arrays;

publicclass_3254 {

publicstaticclassSolution1 {

publicint[]resultsArray(int[]nums,intk) {

intn =nums.length;

int[]ans =newint[n -k +1];

booleansorted;

if (k ==1) {

returnnums;

}

Arrays.fill(ans, -1);

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

sorted =true;

for (intj =i +1;j <i +k;j++) {

if (nums[j] !=nums[j -1] +1) {

sorted =false;

break;

}

}

if (sorted) {

ans[i] =nums[i +k -1];

}

}

returnans;

}

}

}