From 4f1bb81b4401686fa8860756a68c81a7b292008a Mon Sep 17 00:00:00 2001 From: Dimitri Sokolyuk Date: Sat, 27 Aug 2016 23:12:22 +0200 Subject: Solve largest --- go/largest-series-product/README.md | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 go/largest-series-product/README.md (limited to 'go/largest-series-product/README.md') diff --git a/go/largest-series-product/README.md b/go/largest-series-product/README.md new file mode 100644 index 0000000..d9ea9be --- /dev/null +++ b/go/largest-series-product/README.md @@ -0,0 +1,31 @@ +# Largest Series Product + +Write a program that, when given a string of digits, can 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 simply run the command `go test` in the exercise directory. + +If the test suite contains benchmarks, you can run these with the `-bench` +flag: + + go test -bench . + +For more detailed info about the Go track see the [help +page](http://exercism.io/languages/go). + +## Source + +A variation on Problem 8 at Project Euler [http://projecteuler.net/problem=8](http://projecteuler.net/problem=8) + +## Submitting Incomplete Problems +It's possible to submit an incomplete solution so you can see how others have completed the exercise. + -- cgit v1.2.3