Word Lazy Swap

[admin]

Given a dictionary and two words of equal length that are in the dictionary, find the length of the shortest sequence of transformations required to rewrite the first word into the second one. Each word in the sequence must belong to the dictionary and must differ from the previous word by only one letter.

Read

[Francesco Laurita]

Hi Admin!

Could you check my last submission for this puzzle?
My solution pass every test except for the first one. Is there some dirty/tricky input?

Thanks in advance!

[admin]

I checked your latest submission for this puzzle, and the cause of failure for the first test case is CPU exceeded. There's no special tricks, only 100 small test cases (e.g. short paths), it looks like the number of test cases greatly influences your solution runtime regardless of the length of the paths.

[Francesco Laurita]

Yeah I see!
At the least I got my solution accepted even if with a very low score. It looks like I'm missing some kind of pruning.

Thanks!

[bknarendra]

Hey admin can you look at my submission
http://codercharts.com/submission/43108
How is it possible that it passes the hard test cases and not the easy ones
According to me it is correct but don't understand why it fails. Any kind of clue would help.
Does it fail because of memory overuse or some other reason. Plzzzzzz help.