Sha256: c0feb09e6dc11f7e0b3b60a279209a08ec595b110851ce681672cc2ca017534e
Contents?: true
Size: 992 Bytes
Versions: 53
Compression:
Stored size: 992 Bytes
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. To run the tests: ```sh $ gradle test ``` For more detailed info about the Java track see the [help page](http://exercism.io/languages/java). ## 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
53 entries across 53 versions & 1 rubygems