Played Challenges
Levenshtein distance - 105 entries
Compute distance for each pair. Notice that this recursive implementation is very inefficient. Wagner-Fischer algorithm is iterative and much faster. #vimscript
- Best score: 27
- Best player score: 48
- Position: #37 / 37
- Number of attempts: 1
Array propagate - 338 entries
Complete the array with the keys as part of the value
- Best score: 23
- Best player score: 77
- Position: #115 / 119
- Number of attempts: 1