Sha256: 843f21e1d6b366f6781756602d1c9627daeb2bf014be774d374e02ddffe805b6
Contents?: true
Size: 1.38 KB
Versions: 184
Compression:
Stored size: 1.38 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. ## Running Ceylon Tests Before tests can be run, your code must be compiled via [`ceylon compile`](https://ceylon-lang.org/documentation/current/reference/tool/ceylon/subcommands/ceylon-compile.html). We run tests with the [`ceylon test`](https://ceylon-lang.org/documentation/reference/tool/ceylon/subcommands/ceylon-test.html) command. `ceylon test` expects a module name to run the tests on. In the Ceylon track, each exercise has just a single module. Therefore, you can run the tests with: ```bash ceylon compile && ceylon test $(basename source/*) ``` ## 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