...

/

Solution: Shortest Word Distance II

Solution: Shortest Word Distance II

Let's solve the Shortest Word Distance II using the Custom Data Structures pattern.

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

Access this course and 1400+ top-rated courses and projects.