Easy Go solution
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
```golang []
func sumOfGoodNumbers(nums []int, k int) int {
    sum:=0
    for i, val := range nums {
        if i-k>=0 && i+k <= len(nums)-1 {
            if nums[i-k] < val && nums[i+k] < val {
               sum+= val
            }
        } else if i-k>=0 {
            if nums[i-k]<val {
                sum+= val
            }
        } else if i+k <= len(nums)-1 {
            if nums[i+k]< val {
                sum+=val
            }
        }
    }
    return sum
}
```
['Go']