← Google questions

Word ladder modification and OOPs questions

Filed under Google

Given a start word, an end word, and a dictionary of words, find the length of the shortest transformation sequence from start to end, such that only one letter can be changed at a time and each…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.