indices `i - k` and `i + k`.

Example 2

Input: nums = [2,1], k = 1
Output: 2
Explanation:
The only good number is `nums[0] = 2` because it is strictly greater than
`nums[1]`.

Constraints

2 <= nums.length <= 100
1 <= nums[i] <= 1000
1 <= k <= floor(nums.length / 2)

Solution

Method 1 – Direct Index Comparison

Intuition

The problem asks us to find elements that are strictly greater than their neighbors at a fixed distance k, if those neighbors exist. If either neighbor does not exist, the element is automatically considered good. By iterating throu

Related Tags