Letterman (Word Morph Solver) Demo

Finds the shortest valid transformation sequence between words using dictionary constraints.

Code is restricted for academic integrity. This demo loads published spec inputs and replays the corresponding outputs.

Spec input

Expected output

Input

Loaded from: /assets/demos/letterman/spec-simple.txt

Output

Expected loaded from: /assets/demos/letterman/spec-queue-word-output.txt