Just try to cover all edge cases 
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
```python3 []
class Solution:
    def sumOfGoodNumbers(self, nums: List[int], k: int) -> int:
        l = len(nums)
        good_sum = 0
        for i, num in enumerate(nums):
            if i - k < 0 and i + k >= len(nums):
                good_sum += nums[i]
            elif i - k < 0 and i + k < len(nums):
                if nums[i] > nums[i+k]:
                    good_sum += nums[i]
            elif i - k >= 0 and i + k >= len(nums):
                if nums[i] > nums[i-k]:
                    good_sum += nums[i]
            else:
                if nums[i] > nums[i-k] and nums[i] > nums[i+k]:
                    good_sum += nums[i]
        return good_sum


        
```
['Python3']