summaryrefslogtreecommitdiff
path: root/go/palindrome-products/README.md
diff options
context:
space:
mode:
authorDimitri Sokolyuk <demon@dim13.org>2016-08-28 00:23:47 +0200
committerDimitri Sokolyuk <demon@dim13.org>2016-08-28 00:23:47 +0200
commit6a5bafe3d99c26e78c4ce240eb54a917259a9861 (patch)
tree9f7be1a2c46e6bab9b3ae976379c91b45c56524a /go/palindrome-products/README.md
parenta593ae4ca4e3af5c419461284c97a6cc91466d1b (diff)
Solve palindrome
Diffstat (limited to 'go/palindrome-products/README.md')
-rw-r--r--go/palindrome-products/README.md24
1 files changed, 24 insertions, 0 deletions
diff --git a/go/palindrome-products/README.md b/go/palindrome-products/README.md
new file mode 100644
index 0000000..9c404da
--- /dev/null
+++ b/go/palindrome-products/README.md
@@ -0,0 +1,24 @@
+# Palindrome Products
+
+Write a program that can detect palindrome products in a given range.
+
+A palindromic number reads the same both ways. The largest palindrome
+made from the product of two 2-digit numbers is 9009 = 91 x 99.
+
+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
+
+Problem 4 at Project Euler [http://projecteuler.net/problem=4](http://projecteuler.net/problem=4)
+
+## Submitting Incomplete Problems
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.
+