From 6a5bafe3d99c26e78c4ce240eb54a917259a9861 Mon Sep 17 00:00:00 2001 From: Dimitri Sokolyuk Date: Sun, 28 Aug 2016 00:23:47 +0200 Subject: Solve palindrome --- go/palindrome-products/README.md | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 go/palindrome-products/README.md (limited to 'go/palindrome-products/README.md') 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. + -- cgit v1.2.3