Given an array of strings wordsDict and two strings word1 and word2, return the shortest distance between the occurrences of word1 and word2 in the array.

Note: word1 and word2 may be identical. When they are the same, they must refer to two distinct indices in the array.

Constraints:

• $1 \leq$ wordsDict.length $\leq 10^5$

• $1 \leq$ wordsDict[i].length $\leq 10$

• wordsDict[i] consists of lowercase English letters.

• word1 and word2 are in wordsDict.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.