Beats 100%
IntuitionComplexity
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
```python []
class Solution(object):
    def sumOfGoodNumbers(self, nums, k):
        t_sum=0
        for i in range (len(nums)):
            if (i-k)>=0 and (i+k)<len(nums):
                if(nums[i]>nums[i-k] and nums[i]>nums[i+k]):
                    t_sum+=nums[i]
            elif i-k<0:
                if nums[i]>nums[i+k]:
                    t_sum+=nums[i]
            elif i+k>=len(nums):
                if nums[i]>nums[i-k]:
                    t_sum+=nums[i]
        return t_sum

```
['Python']