Word/Sequence Transformation (BFS)

Problem Overview

Given a classic single-word transformation problem (e.g., transform one word into another by changing one letter at a time, where each intermediate word must be valid — the standard Word Ladder / BFS problem), extend the solution to handle a sequence/multi-word version: transform a sequence of words step by step.…

• 1 candidate-reported follow-up — the exact probes interviewers asked, with the trigger for each
• The rest of the problem statement — full requirements, constraints, and edge cases
• Approach and trade-offs — what passing candidates did, and the mistakes that sink people