Sha256: 30f9862b988bf7e2ec894ef50a50d609e5fbd948eb708940e496fd656d64b930
Contents?: true
Size: 321 Bytes
Versions: 222
Compression:
Stored size: 321 Bytes
Contents
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.
Version data entries
222 entries across 222 versions & 1 rubygems