-
-
Notifications
You must be signed in to change notification settings - Fork 46.5k
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.
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
Add word ladder algorithm in backtracking #11590
Add word ladder algorithm in backtracking #11590
Conversation
for more information, see https://pre-commit.ci
… into wordladder_new_algo
for more information, see https://pre-commit.ci
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper
commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper review
to trigger the checks for only added pull request files@algorithms-keeper review-all
to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
for more information, see https://pre-commit.ci
… into wordladder_new_algo
for more information, see https://pre-commit.ci
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks for your contribution and for your changes!
Thanks for the helpful feedback and merging my PR! |
Describe your change:
Implemented the Word Ladder algorithm in the Backtracking folder.
The Word Ladder problem involves transforming a start word into a target word by changing one letter at a time, where each intermediate word must be a valid word from a given list. The challenge is to find a transformation sequence from the start word to the end word. In this backtracking approach, we attempt to explore all possible transformations, ensuring that each transformation is valid and leading us towards the end word.
Algorithm:
begin_word
and recursively explore all valid transformations.end_word
, the process is complete, and the transformation sequence is returned.Checklist: