Word Ladder Variants with Trie Optimization

Requirements Given beginWord, endWord, and wordList, find transformations that begin at the start word and finish at the target using words from the dictionary. In the standard form, each consecutive pair in a transformation must differ in exactly one character. When the all-shortest-paths version is requested, return every transformation sequence with minimum length. As a variation, support fuzzy string matching or tolerance, and then improve candidate lookup with a prefix…