Neetcode Spaced Repetition System

127. Word Ladder

Hard

Graphs

Optimal Complexity

Time

O((m ^ 2) * n)

Space

O((m ^ 2) * n)

Start First Attempt
Word Ladder — NeetcodeSRS