Érico Nogueira
78747594b7
Two solutions: p.rkt is the naive solution and works for part 1, but fails hard at part 2. It was slow enough I couldn't even get to memory exhaustion. p2.rkt uses a hash map for pairs and a hash map for character count, both of which are updated for each iteration. This one can probably deal with any reasonable number of iterations. |
||
|---|---|---|
| .. | ||
| p.rkt | ||
| p2.rkt | ||
| test1.txt | ||
| test2.txt | ||