Coding - Shortest Word Distance

Shortest Word Distance

You are given an array of strings wordsDict and two different strings word1 and word2 that both appear in the array. Return the minimum distance between any occurrence of word1 and any occurrence of word2 in wordsDict.

Example 1:

Input: wordsDict = ["practice", "makes", "perfect", "coding", "makes"], word1 = "makes", word2 = "coding" Output: 3

Example 2:

Input: wordsDict = ["practice", "makes", "perfect", "coding", "makes"], word1 = "makes", word2 = "makes" Output: 1

Constraints:

• 1 <= wordsDict.length <= 100
• 1 <= wordsDict[i].length <= 10
• wordsDict[i] consists of lowercase English letters.
• word1 and word2 are in wordsDict and are distinct.

Hint:

• Consider maintaining a variable to store the minimum distance as you iterate through the words in the dictionary.