Solution: Shortest Word Distance II
Explore how to build a custom data structure that stores word indices to quickly compute the shortest distance between any two different strings in an array. Understand the use of dictionary mapping and the two-pointer technique for efficient traversal, enabling you to handle up to 1000 queries with optimal 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...