Very Easy and Good Method To find Sum of Good Numbers 
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++) {

            if(i - k < 0 && i + k >= n) {
                sum += nums[i];
            }
            else if(i - k < 0 && i + k < n) {
                if(nums[i] > nums[i + k])
                    sum += nums[i];
            }
            else if(i - k >= 0 && i + k >= n) {
                if(nums[i] > nums[i - k])
                    sum += nums[i];
            }
            else {
                if(nums[i] > nums[i - k] && nums[i] > nums[i + k])
                    sum += nums[i];
            }
        }

        return sum;
    }
};
```
['C++']