Available question text
Given a list of words and two distinct target words, find the minimum absolute index distance between any occurrence of the two targets. This is essentially a closest-pair-in-array problem often solved with a single linear scan that tracks the last-seen positions of each target.
Related questions
Continue with questions that share topics or the same question type.
- Shortest Word Distance II
Coding · Array · Design · Hash Table
- Shortest Uncommon Substring in an Array
Coding · Array · Hash Table · String
- Word Break
Coding · Array · Brute-Force Search · Dynamic Programming
- Word Break II
Coding · Array · Backtracking · Dynamic Programming
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
LinkedIn
Leetcode 243. Shortest Word Distance
Reported Dec 20, 2025 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Snowflake
Shortest Word Distance
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 62.9. This is not an interview probability.
View source