Given two words of identical length, find the shortest “Word Ladder” that you can construct between them.
(e.g. from HATE to LOVE in three steps: HATE - LATE - LAVE - LOVE)
Use 4 letter words only
here's the source: [login to view URL]
implement a graph (for the word ladders and the performer chains) on which you will perform breadth-first search. Either use the STL or write your own classes.
Want to use a list, an array, a stack, a queue, or a map/search-structure? Feel free to use the ones built in to C++, but write your own graph class.
I need this to be done by Wednesday morning.. this shouldn't be hard.. I'm just too busy with other projects.. budget between $30 to $50 thank you!
I have been developing c, c++ programs for 10 years.
I have developed many programs.
So I think I can do it so that you satisfy.
I am looking forward to being hired by you.
I hope to meet you later!
I'll do my best to do it.
Please award my bid and hire me.
I'll make you satisfy.
Believe me.
And Contact to me.
I can start my work at once.
I'll wait your visit.
Thank you!