Shortest Word Distance II

LeetCode 244 • Medium • Design • Anduril

Design WordDistance: preprocess dict once; shortest(w1,w2) via two pointers on index lists.

TimeO(n) prep

SpaceO(n)

Word index

step—

note—

Speed:

Ready

Press Play to walk the algorithm.

Whiteboard

Size:3

Type It

class WordDistance — __init__(wordsDict), shortest(word1, word2).

═══ WORD DISTANCE II (LC 244) ═══

PATTERN ▸ map → indices + two ptr

① build dict[word]=list of idxs

② two pointers on both lists

advance smaller index

your implementation

Verify: