Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Word Ladder
Transform one word into another, changing one letter at a time, using only valid dictionary words. It's a shortest-path problem hiding behind a word puzzle—BFS finds the minimum steps. The insight is modeling words as graph nodes where edges connect words that differ by exactly one letter.
Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Desktop required to run this problem
StrongYes runs real code + tests in a desktop editor. Mobile is view-only for now, so you can’t start this here. Sorry about that — email yourself a link and pick it up on your computer.
Desktop required
Sorry — mobile can’t run the editor + tests yet. Email yourself a link to continue on desktop.