Available question text
Return all indices i such that there exists an index j with nums[j] == key and |i - j| <= k — equivalently, compute the union of k-radius neighborhoods around each occurrence of key and return those indices in increasing order.
Related questions
Continue with questions that share topics or the same question type.
- Find All Duplicates in an Array
Coding
- Find All Good Indices
Coding
- Find All Lonely Numbers in the Array
Coding · Array · Counting · Hash Table
- Find All Numbers Disappeared in an Array
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2200. Find All K-Distant Indices in an Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source