You are given an array of integers nums of length n and a positive integer k.

The power of an array is defined as:

• Its maximum element if all of its elements are consecutive and sorted in ascending order (meaning each adjacent element differs by exactly $+1$).

• $-1$ otherwise.

Return an array of integers results of size n $-$ k $+ 1$, where results[i] is the power of the subarray of size k starting at index i.

Constraints:

• $1 \leq n ==$ nums.length $\leq 500$

• $1 \leq$ nums[i] $\leq 10^5$

• $1 \leq k \leq n$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.