Word Ladder Leetcode Hard

[sardonicankita]

Aim

To solve the leetcode hard problem "Word Ladder" in C++. 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. Admins please assign this to me under LGM SOC'21.

Details

A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that:

1. Every adjacent pair of words differs by a single letter.
2. Every si for 1 <= i <= k is in wordList. Note that beginWord does not need to be in wordList.
3. sk == endWord

Programming language

• [ ] C
• [x] C++
• [x] Java
• [x] Python

[Saurabh4626]

do in any language but clean code

[kamleshjoshi8102]

Hi @Saurabh4626 I want to provide it's Solution under LGMSOC'21 in Python

[Saurabh4626]

@kamleshjoshi8102 this problem is already assigned.

[kamleshjoshi8102]

@Saurabh4626 but we can submit our solution in other languages too can't we?

[Pratik57]

@Saurabh4626 assgin me this problem to complete it in C under LGMSOC21

[ghost]

Assign me above problem statement in java