Word Ladder LeetCode

#1

Getting TLE
Code Link—https://ide.geeksforgeeks.org/vvyrn6FIQ7

#2

hello @Bhawna
pls share the problem link as well

#3

ignore my previous reply , i have found the problem link

#4

@Bhawna
ur approach is correct but it is bit time consuming becuase the find function is itself O(n) and then u are chekcing stirng in map which log(n) for each search.

try to improve it , bfs approach is already given there in solution section

#5

Solved now Thanks…

#6

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.