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

Solution: Shortest Word Distance II

Understand how to build a custom data structure for efficiently calculating the shortest distance between two words in an array. Explore techniques like dictionary indexing and a two-pointer traversal method to minimize search time. Learn to evaluate time and space complexity for optimized query performance in coding interviews.

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

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

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