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.