Search⌘ K
AI Features

Solution: Shortest Word Distance II

Explore how to implement a WordDistance class that quickly calculates the shortest distance between any two words in a string array. Understand the design of a dictionary-based data structure and a two-pointer method to efficiently solve word distance queries. This lesson equips you to handle similar coding interview problems involving custom data structures and optimized searching techniques.

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