Sha256: fb0147af200a7a0c482614e3230926b91f0af992a6e00a572526951ebc9a4203
Contents?: true
Size: 1.24 KB
Versions: 181
Compression:
Stored size: 1.24 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. ## Setup Follow the setup instructions for Crystal here: http://exercism.io/languages/crystal More help installing can be found here: http://crystal-lang.org/docs/installation/index.html ## Making the Test Suit Pass Execute the tests with: ```bash $ crystal spec ``` In each test suite all but the first test have been skipped. Once you get a test passing, you can unskip the next one by changing `pending` to `it`. ## 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
181 entries across 181 versions & 1 rubygems