add 3254

Author: fishercoder1534

paginated_contents/algorithms/4th_thousand/README.md

@@ -1,5 +1,6 @@
 | #    | 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     |

src/main/java/com/fishercoder/solutions/fourththousand/_3254.java

@@ -0,0 +1,30 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.Arrays;
+
+public class _3254 {
+    public static class Solution1 {
+        public int[] resultsArray(int[] nums, int k) {
+            int n = nums.length;
+            int[] ans = new int[n - k + 1];
+            boolean sorted;
+            if (k == 1) {
+                return nums;
+            }
+            Arrays.fill(ans, -1);
+            for (int i = 0; i <= n - k; i++) {
+                sorted = true;
+                for (int j = i + 1; j < i + k; j++) {
+                    if (nums[j] != nums[j - 1] + 1) {
+                        sorted = false;
+                        break;
+                    }
+                }
+                if (sorted) {
+                    ans[i] = nums[i + k - 1];
+                }
+            }
+            return ans;
+        }
+    }
+}