Solution: Shortest Word Distance II
Explore how to implement the WordDistance class to preprocess an array of words and efficiently compute the shortest distance between any two distinct words. Understand the use of a dictionary to store word indices and a two-pointer approach to traverse these indices for quick queries. This lesson helps you optimize querying word distances with good time and space complexity.
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 betweenword1andword2in the array of strings.
Constraints:
wordsDict.length...