Please give me an appraoch to solve this
Leetcode array doubt
hello @Somasree
use simple bfs.
start from given begin string. in each operation change one character and see if newly formed word is in the worlist or not.
if it is then put it in queue otherwise discard.
continue doing this till u find ur endstring.
the resultant number of steps will be minimum becuase we are searching in breadth first order
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
the doubt.