Measure the Closest Occurrences of Two Different Words

### Problem Given wordsDict and two distinct words occurring in it, return the minimum absolute difference between an index of word1 and an index of word2. Indices are zero-based. ```cpp int shortestDistance(vector<string>& wordsDict, string word1, string word2); ``` ### Examples ```text wordsDict = ["red","blue","red","green","blue"], word1="red", word2="blue" -> 1 wordsDict = ["one","x","two"], word1="one", word2="two" -> 2 ``` ### Constraints - Dictionary length is 2 through 30000. - Every word and target has 1 through 10 lowercase English letters. - Targets differ and both are present.