Leetcode 243. Shortest Word Distance
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.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late December, 2025
Junior
Hello Interview Premium
Your account is free and you can post anonymously if you choose.