Sha256: 8d904fa71cb6baa79a6f9c9c5dee10f0722e99a00a0b456b4cef76cfebd55aa8
Contents?: true
Size: 1.18 KB
Versions: 174
Compression:
Stored size: 1.18 KB
Contents
# Largest Series Product Given a string of digits, calculate the largest product for a contiguous substring of digits of length n. For example, for the input `'1027839564'`, the largest product for a series of 3 digits is 270 (9 * 5 * 6), and the largest product for a series of 5 digits is 7560 (7 * 8 * 3 * 9 * 5). Note that these series are only required to occupy *adjacent positions* in the input; the digits need not be *numerically consecutive*. For the input `'73167176531330624919225119674426574742355349194934'`, the largest product for a series of 6 digits is 23520. * * * * 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. ## Source A variation on Problem 8 at Project Euler [http://projecteuler.net/problem=8](http://projecteuler.net/problem=8) ## Submitting Incomplete Solutions It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
174 entries across 174 versions & 1 rubygems