Word Ladder at Tekion

Hard44.9% acceptance

This problem has 62.5% frequency at Tekion.

Problem Description

A **transformation sequence** from word `beginWord` to word `endWord` using a dictionary `wordList` is a sequence of words `beginWord -> s1 -> s2 -> ... -> sk` such that: * Every adjacent pair of words differs by a single letter. * Every `si` for `1 <= i <= k` is in `wordList`. Note that `begin...

Read full problem and hints

Topics

Hash Table String Breadth-First Search

Also asked at 36 companies

Adobe Amazon Apple Arcesium Bloomberg Box ByteDance Capital One Citadel CleverTap DocuSign eBay Expedia Flipkart Goldman Sachs Google LinkedIn MakeMyTrip Meta Microsoft+16 more

View Full Problem

Problem Description

Topics

Also asked at 36 companies

More Tekion Questions