Very easy solution just a 4 line code beats 100 percent
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
```cpp []
class Solution {
public:
    int sumOfGoodNumbers(vector<int>& nums, int k) {
        int sum = 0;
        int n = nums.size();
        for(int i=0;i<n;i++){
            int index1 = i-k;
            int index2 = i+k;
            if((index1 >=0 && nums[i] <= nums[index1]) || (index2 <=n-1 && nums[i] <= nums[index2])){
                continue;
            }
            sum+=nums[i];
        }
        return sum;
    }
};
```
['C++']