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

Solution: Shortest Word Distance II

Explore how to implement a custom data structure in C# that stores word positions and uses a two-pointer technique to quickly compute the shortest distance between any two words in an array. Understand the tradeoffs in time and space complexity to prepare for coding interviews effectively.

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