Word Ladder II at Yelp

Hard27.5% acceptance

This problem has 100.0% frequency at Yelp.

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 Backtracking Breadth-First Search

Also asked at 13 companies

Amazon Apple Bloomberg Citadel Google LinkedIn Lyft Meta Microsoft Nutanix Okta TikTok Uber

View Full Problem

Problem Description

Topics

Also asked at 13 companies

More Yelp Questions