I cannot understand how to solve this .please help
make the graph of words given in the problem such that two connected nodes only differ by one character
and then use bfs to find the shortest path between sources string to destination string
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen