Java easy Solution for Sum of Good numbers in 1ms 99.9%beats
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 n = nums.length;
        int sum = 0;

        for (int i = 0; i < n; i++) {
            if ((i - k >= 0 ? nums[i] > nums[i - k] : true) &&
                (i + k < n ? nums[i] > nums[i + k] : true)) {
                sum += nums[i];
            }
        }
        return sum;
    }
}
```
['Java']