Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 10
How do you find the shortest transformation sequence in Word Ladder (change one letter at a time)?
A
Sorting the dictionary
B
Dijkstra with random weights
C
BFS over words, generating neighbours via wildcard patterns (h*t) or letter substitutions; bidirectional BFS speeds it up
D
DFS with backtracking