Leetcode Problem 244. Shortest Word Distance II

244. Shortest Word Distance II

Leetcode Solutions

Initialize a dictionary to store the list of indices for each word in the input array.
Iterate over the input array and populate the dictionary with the word as the key and its indices as the value.
For the shortest method, retrieve the sorted lists of indices for both word1 and word2 from the dictionary.
Initialize two pointers, i and j, to iterate over the two lists of indices.
While both pointers are within the bounds of their respective lists, calculate the current distance and update the minimum distance if the current is smaller.
Increment the pointer which points to the smaller index value to potentially find a closer match.
Continue until one of the lists is fully traversed.
Return the minimum distance found.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen