Shortest Word Distance II
Try to solve the Shortest Word Distance II problem.
We'll cover the following
Statement
Design a data structure that takes in an array of strings and efficiently computes the shortest distance between any two different strings in the array.
Implement the WordDistance
class:
WordDistance(String[] wordsDict)
: Initializes the object with an array of strings.int shortest(String word1, String word2)
: Returns the shortest distance betweenword1
andword2
in the array of strings.
Constraints:
wordsDict.length
wordsDict[i].length
wordsDict[i]
 consists of lowercase English lettersword1
 andÂword2
 are inÂwords_dict
word1
!=word2
At most,Â
 calls will be made to the shortest
Examples
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.