Search⌘ K
AI Features

Solution: Shortest Word Distance II

Explore how to implement the WordDistance class that pre-processes an array of words to efficiently compute the shortest distance between any two given words. Understand the use of a dictionary to store word positions and the two-pointer technique to query distances, enabling fast and effective word distance calculations.

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 ...