Java || Almost 100% Beats || Easy to Understand
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int sumOfGoodNumbers(int[] nums, int k) {
        int sum = 0;

        for(int i = 0; i < nums.length; i++) {
            if(i - k >= 0 && nums[i - k] < nums[i]) {
                if(i + k < nums.length && nums[i + k] < nums[i]) {
                    sum += nums[i];
                }else if(i + k > nums.length - 1 && nums[i - k] < nums[i]) {
                    sum += nums[i];
                }
            }else if(i - k < 0 && nums[i + k] < nums[i]){
                sum += nums[i];
            }
        }

        return sum;
    }
}
```
['Java']