Junior
Shortest Word Distance
Given an array of strings wordsDict and two different strings word1 and word2, return the shortest distance between the indices of these two words in wordsDict.
The distance between two words is the absolute difference between their positions in the array. Both word1 and word2 are guaranteed to appear in wordsDict.
Example 1
Input
wordsDict = ["practice","makes","perfect","coding","makes"], word1 = "coding", word2 = "practice"Output
3The word
coding is at index 3 and practice is at index 0, so their distance is 3.Example 2
Input
wordsDict = ["practice","makes","perfect","coding","makes"], word1 = "makes", word2 = "coding"Output
1The closest occurrence of
makes is at index 4 and coding is at index 3, giving a distance of 1.Constraints
- 1 <= wordsDict.length <= 3 * 10^4
- 1 <= wordsDict[i].length <= 10
- wordsDict[i] consists of lowercase English letters.
- word1 and word2 are in wordsDict.
- word1 != word2