Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.