Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Word Ladder in Python #948

Open
Robinrai2612 opened this issue Oct 6, 2023 · 3 comments
Open

Word Ladder in Python #948

Robinrai2612 opened this issue Oct 6, 2023 · 3 comments

Comments

@Robinrai2612
Copy link

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 beginWord does not need to be in wordList.
sk == endWord
Given two words, beginWord and endWord, and a dictionary wordList, return the number of words in the shortest transformation sequence from beginWord to endWord, or 0 if no such sequence exists.
@Robinrai2612
Copy link
Author

Hello @Rishabh062 could you kindly assign this issue to me for Hacktoberfest 2023? Thank you!

@VBPMP
Copy link

VBPMP commented Oct 7, 2023

please Assign this task to me

@princetoday
Copy link

"I would like to work on this issue. Please assign it to me."

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@Robinrai2612 @VBPMP @princetoday