Search⌘ K
AI Features

Solution: Shortest Word Distance II

Explore how to design a WordDistance class that computes the shortest distance between any two words in an array efficiently. Understand the use of a dictionary to map word positions and apply a two-pointer technique to minimize distance calculations. This lesson improves your ability to implement custom data structures for faster query solutions.

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 between word1 and word2 in the array of strings.

Constraints:

  • 11 \leq wordsDict.length 103\leq10^3 ...