Given an array of strings wordsDict and two different strings word1 and word2 that both exist in wordsDict, return the minimum absolute index difference between any occurrence of word1 and any occurrence of word2 in the array.

Constraints:

• $2 \leq$ wordsDict.length $\leq 3 imes 10^4$

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

• wordsDict[i] consists of lowercase English letters.

• word1 and word2 are in wordsDict.

• word1 $\neq$ word2

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.