Given an integer array nums and an integer k.

An element nums[i] is considered a good number if it satisfies the following conditions:

• nums[i] > nums[i - k] whenever index i - k is within the bounds of the array.

• nums[i] > nums[i + k] whenever index i + k is within the bounds of the array.

Return the sum of all good numbers in nums.

Constraints:

• $2 \leq$ nums.length $\leq 100$

• $1 \leq$ nums[i] $\leq 1000$

• $1 \leq$ k $\leq \lfloor$nums.length $/ 2\rfloor$

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.