exercism
I have contributed by creating some problems for the Racket track in exercism:
- Implement ETL: ETL consists basically of a hash table inversion: given a table “score -> list of letters”, build a table “letter -> score”.
-
Add the accumulate problem: Accumulate is another way of calling what the
foldlfunction does in Racket (also called reduce in functional programming): Obtain a scalar value out of a list by applying a function to each element and updating (accumulating) the result at each step. Note (2020-06-24): For some reason it appears that this implements map instead, but I don’t remember why it was called accumulate…