Minimum Distance Between Words | Dataford Interview Questions

FogHorn Systems processes text associated with industrial alerts. Given a sentence and two target words, return the minimum distance between any occurrence of the targets.

Treat each maximal sequence of English letters as one word, ignore punctuation, and compare words case-insensitively. A word's position is its zero-based index in the normalized token list. The distance between two occurrences is the absolute difference between their positions. If the target words are identical, use two distinct occurrences. Return -1 if either target cannot be found or if identical targets occur fewer than two times.

Formal Specification

Implement min_word_distance(sentence, word1, word2).

Input: sentence, a string; word1 and word2, non-empty strings containing English letters.
Output: an integer representing the smallest valid positional distance, or -1 when no valid pair exists.

Constraints

1 <= len(sentence) <= 10^5
The normalized sentence contains at most 10^4 words
word1 and word2 are non-empty alphabetic strings
Matching is case-insensitive
Punctuation does not count as a word
Return token-position distance, not the number of intervening words

Function Signature

def min_word_distance(sentence, word1, word2):

Your question is Minimum Distance Between Words. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem