Simple Java Solution || Beats 99%
IntuitionApproachComplexity
Time complexity: O(1)

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

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

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

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

# Code
```java []
class Solution {
    public int sumOfGoodNumbers(int[] nums, int k) {
        int sum=0,n=nums.length;
       for(int i=0;i<n;i++){
        boolean isGood=true;
         if(i-k>=0 && nums[i]<=nums[i-k]) isGood=false;
         if(i+k<n && nums[i]<=nums[i+k]) isGood=false;
         if(isGood) sum+=nums[i];
       } return sum;
    }
}
```
['Array', 'Java']