Algorithms Engineer · University of Michigan Course Project
Letterman Word Morph
A configurable word-transformation solver that finds paths between dictionary words using breadth-first or depth-first search.
Overview
What I built
Letterman treats words as nodes in an implicit graph and valid single-step edits as edges. The solver reads simple and compressed dictionaries, discovers reachable transformations, and reconstructs a path between the requested start and end words.