.. | ||
palindrome | ||
palindrome_products_test.go | ||
palindrome_products.go | ||
README.md |
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.
Source
Problem 4 at Project Euler view source