Sha256: 287e134e4dc46ad18fc00e8ab337f00c3e3cd97cdb813b9c8b549ec1ee7c1bb6
Contents?: true
Size: 1.55 KB
Versions: 96
Compression:
Stored size: 1.55 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 tests
Execute the tests with:
```bash
$ elixir bob_test.exs
```
(Replace `bob_test.exs` with the name of the test file.)
### Pending tests
In the test suites, all but the first test have been skipped.
Once you get a test passing, you can unskip the next one by
commenting out the relevant `@tag :pending` with a `#` symbol.
For example:
```elixir
# @tag :pending
test "shouting" do
assert Bob.hey("WATCH OUT!") == "Whoa, chill out!"
end
```
Or, you can enable all the tests by commenting out the
`ExUnit.configure` line in the test suite.
```elixir
# ExUnit.configure exclude: :pending, trace: true
```
For more detailed information about the Elixir track, please
see the [help page](http://exercism.io/languages/elixir).
## 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
96 entries across 96 versions & 1 rubygems