Word Transformation Path with One- or Two-Character Moves

Asked at Reddit · Coding Questions · Difficulty: Hard · Last asked Jul 21, 2025

Given a dictionary of words, a start word and a target word, decide whether the start word can be transformed into the target word through a chain of words. Each step changes **exactly one or exactly two** characters (positions stay fixed; no insertion or deletion), and every intermediate word must belong to the dictionary.

Loading the problem…