ahaferburg

23 ms·

1. 241.▲
   by ahaferburg 8y ago

   Isn't that O(n∙m²)? for each string (n) for each char (n∙m) zero out char, compute hash (n∙m²)
2. 242.▲
   by ahaferburg 8y ago

   You can skip days, though. Some are easier than others.
3. 243.▲
   by ahaferburg 8y ago

   I wanted to always compile everything, and I don't have modules yet. Every problem is in one function, so for AOC it wasn't a problem.
4. 244.▲
   by ahaferburg 8y ago

   I used it as a workout for the compiler that I'm writing. I solved every problem in my own language, so that was pretty cool. The language is now almost as powerful as C. I kept all the code in one file, which now has grown to 4500 LoC