← ServiceNow questions

Word Ladder, Sort Stack, Segment Tree

Filed under ServiceNow

Given a begin word, an end word, and a dictionary of words, find the shortest transformation sequence from begin word to end word, 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 ServiceNow questions

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