A test of CS fu
Pull request Compare This branch is 4 commits behind waypaver:master.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
README.md
randomlist.txt

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 its friends, plus all of their friends, and all of their friends’ friends, and so on.

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