ilikedeal
BAN USER
Comments (5)
Followers (3)
Reputation 65
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Page:
1
Repfanniepaisley, Computer Scientist at ABC TECH SUPPORT
Fannie Parsley, and I'm working as a Cartographer. And nowadays I am doing a new experiment on best tantrik ...
RepShirleyCWest, Software Engineer at Agilent Technologies
Hello, me Shirley and I from Savage. I am an artist and I love to doing art and I am ...
Reppihupiter, university professor at Precious Moments
Expert English literature and language university professor with more than 5 years of experience teaching at the college level. Outside ...
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Well, probably this is an algorithm probelm instead of a design problem. Convert to an directed graph, every word as a node and any two words with only one character different have one edge with weight 1 connecting them. From the source node to the target node, it's like find a path between them, then you can use Dijkstra's algorithm or Dp and the path is the answer.
- ilikedeal February 09, 2010