Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Python

Solution: Shortest Word Distance II

Explore how to implement a WordDistance class that preprocesses an array of words to quickly calculate the shortest distance between any two words. Learn the use of a dictionary to store word positions and apply a two-pointer technique to optimize query time, enhancing your skills in custom data structure design.

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[] words_dict): 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:

  • 1≤1 \leq words_dict.length ≤103\leq10^3

  • 1≤1 \leq words_dict[i].length ...