Available question text
Given an array, a target value, and a start index, return the minimum absolute distance |i - start| to any index i where nums[i] == target. The task is essentially to find the nearest occurrence of target by index (e.g., by scanning or expanding outward), with target guaranteed to exist.
Related questions
Continue with questions that share topics or the same question type.
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 1848. Minimum Distance to the Target Element
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source