Sha256: a56ae296c9ac19dafdb7905f45133c397c446814294e1aa2db58057f8145cab7
Contents?: true
Size: 856 Bytes
Versions: 68
Compression:
Stored size: 856 Bytes
Contents
# Parallel Letter Frequency Count the frequency of letters in texts using parallel computation. Parallelism is about doing things in parallel that can also be done sequentially. A common example is counting the frequency of letters. Create a function that returns the total frequency of each letter in a list of texts and that employs parallelism. * * * * For installation and learning resources, refer to the [exercism help page][]. [exercism help page]: http://exercism.io/languages/lfe To run the provided tests, you will need `make`. Open a terminal window and run the following from the exercise directory: ```sh make test ``` You should now be able to see the results of the test suite for the exercise. ## Submitting Incomplete Solutions It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
68 entries across 68 versions & 1 rubygems