Goal:

I created a 3 part application, which runs locally, for finding anagrams & prefixed words, and creates word ladders given a start and end word. The returned lists are valid words of a standard lexicon.

Solution:

For the word ladder, my solution used BFS on all paths that were one letter away from the start word. For anagrams, I used a hash whose key was the sorted word. Here is a link to my Github, to view the full implementation.

Languages Used:

Ruby, JQuery, JavaScript, XML & CSS