Sha256: 795073b4ac5d78b5b7d6c439f6cf5f66aea064685c9d23b1cad5be8c41170c47
Contents?: true
Size: 1.37 KB
Versions: 106
Compression:
Stored size: 1.37 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. ## Elm Installation Refer to the [Exercism help page](http://exercism.io/languages/elm) for Elm installation and learning resources. ## Writing the Code The first time you start an exercise, you'll need to ensure you have the appropriate dependencies installed. ```bash $ npm install ``` Execute the tests with: ```bash $ npm test ``` Automatically run tests again when you save changes: ```bash $ npm run watch ``` As you work your way through the test suite, be sure to remove the `skip <|` calls from each test until you get them all passing! ## 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
106 entries across 106 versions & 1 rubygems