hey i am not able to understand the approach
pls provide some elaborated explaination
Word ladder -|-|-|-|-|-|-
Hey Abdullah!, this is a traditional graph theory problem, think every word as a node and all words which have one different letter are joined by edge!
Now this becomes a shortest path value problem between two nodes which are your starting and ending words. This can be done using BFS.
@mayankA47 my main concern is how to build a graph of strings and how to connect the
?
pls explain in detail