100% 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
```c []
int sumOfGoodNumbers(int* a, int n, int k) 
{
    int sum=0;
    for(int i=0;i<n;i++)
    {
        if((i-k)>=0 && (i+k)<n && a[i]>a[i+k] && a[i]>a[i-k])
        {
            sum=sum+a[i];
        }
        if((i-k)<0 && (i+k)<n && a[i+k]<a[i])
        {
            sum=sum+a[i];
        }
        if((i-k)>=0 && (i+k)>n-1 && a[i-k]<a[i])
        {
            sum=sum+a[i];
        }
    }
    
    return sum;
}
```
['C']