A test of CS fu
Latest commit 40047dc Oct 23, 2014 @keathley keathley Update README.md
Permalink
Failed to load latest commit information.
README.md Update README.md Oct 23, 2014
randomlist.txt Update the wordlist Sep 14, 2014

README.md

Challenge Time

Introduction

Two words are friends if they have a Levenshtein distance of 1. That is, you can add, remove, or substitute exactly one letter in word X to create word Y. A word’s social network consists of all of it's friend, all of it's friends friends, and all of it's friends friends friends.

Problem

Write a program in your favorite dynamic language that efficiently finds the social network for any given word, using the word list provided.

Submission

Please email your completed program to careers@waypaver.co