README.md (1213B) - raw
1 # Largest Series Product 2 3 Welcome to Largest Series Product on Exercism's Perl 5 Track. 4 If you need help running the tests or submitting your code, check out `HELP.md`. 5 6 ## Instructions 7 8 Given a string of digits, calculate the largest product for a contiguous 9 substring of digits of length n. 10 11 For example, for the input `'1027839564'`, the largest product for a 12 series of 3 digits is 270 (9 \* 5 \* 6), and the largest product for a 13 series of 5 digits is 7560 (7 \* 8 \* 3 \* 9 \* 5). 14 15 Note that these series are only required to occupy *adjacent positions* 16 in the input; the digits need not be *numerically consecutive*. 17 18 For the input `'73167176531330624919225119674426574742355349194934'`, 19 the largest product for a series of 6 digits is 23520. 20 21 For a series of zero digits, the largest product is 1 because 1 is the multiplicative identity. 22 (You don't need to know what a multiplicative identity is to solve this problem; 23 it just means that multiplying a number by 1 gives you the same number.) 24 25 ## Source 26 27 ### Created by 28 29 - @bistik 30 31 ### Contributed to by 32 33 - @dogsleg 34 - @kytrinyx 35 - @m-dango 36 - @petertseng 37 - @rfilipo 38 39 ### Based on 40 41 A variation on Problem 8 at Project Euler - http://projecteuler.net/problem=8