summaryrefslogtreecommitdiff
path: root/go/largest-series-product/README.md
diff options
context:
space:
mode:
authorDimitri Sokolyuk <demon@dim13.org>2016-08-27 23:12:22 +0200
committerDimitri Sokolyuk <demon@dim13.org>2016-08-27 23:12:22 +0200
commit4f1bb81b4401686fa8860756a68c81a7b292008a (patch)
treee087c622fecb4db25ed3b5fd3df08bdce3877305 /go/largest-series-product/README.md
parent3ea8f591f0e15f46dd8eb196f7dae2dd6ae4116d (diff)
Solve largest
Diffstat (limited to 'go/largest-series-product/README.md')
-rw-r--r--go/largest-series-product/README.md31
1 files changed, 31 insertions, 0 deletions
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.
+