Sha256: 29aca3403362ad2c97c1d03046812dcf280598756697cd4d8753c816a312f99b
Contents?: true
Size: 1.05 KB
Versions: 184
Compression:
Stored size: 1.05 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. # How to run the tests If you don't know how to run Vader tests, see: [Tests](http://exercism.io/languages/vimscript/tests). For general information about the Vim script track, see: [Help](http://exercism.io/languages/vimscript). ## 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
184 entries across 184 versions & 1 rubygems