wip solution to problem one
update with explanations and test cases
Added hangman game implementation by Adrian Gruntkowski
Stopped penalizing for repeated wrong letters. Added display of used
letters so far.
Add week 2 easy problem
Merge pull request #3 from supernullset/master

Easy Challenge. Week One.
Merge pull request #4 from zoldar/zoldar

Added hangman game implementation by Adrian Gruntkowski
Add week 2 easy problem
Merge pull request #5 from supernullset/master

Add week 2 easy track
Converts to lein project
Merge pull request #6 from locks/easy-lein-proj

Converts to lein project
Attempt One by Sean the Younger
Updated version!!

Handles all the things... I think
More time away from work means more attempts..

Refactored the actual leve dist calculation out on it's own so
the core func is a little cleaner.

Still not convinced about this though..
Painful syntax error corrected. ;(
inefficient recursive solution to levenshtein
Merge pull request #8 from rubysolo/master

recursive solution to levenshtein
Merge pull request #7 from mankyKitty/master

Attempt One at Levenshtein Distance
Refactored the comparison into the map function.

Moved the if statement into the map function for better readability
and added more comments around what I was thinking and why it is the
way it is.
Merge pull request #9 from mankyKitty/master

Apologies for another PR but this stuff is so addictive...