Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

README updates from problem-specifications #917

Merged
merged 10 commits into from
Nov 14, 2020
Prev Previous commit
Next Next commit
palindrome-products: specify product of two numbers
For me it took a while to understand that we calculate product of
exactly two numbers. BTW in the [original
problem](https://projecteuler.net/problem=4) it is stated clearly.

exercism/problem-specifications#1662
DmitrySamoylov authored and petertseng committed Oct 10, 2020
commit 3e66bc567b1675c43d4e5a2b0517d882212f2647
2 changes: 1 addition & 1 deletion exercises/palindrome-products/README.md
Original file line number Diff line number Diff line change
@@ -6,7 +6,7 @@ A palindromic number is a number that remains the same when its digits are
reversed. For example, `121` is a palindromic number but `112` is not.

Given a range of numbers, find the largest and smallest palindromes which
are products of numbers within that range.
are products of two numbers within that range.

Your solution should return the largest and smallest palindromes, along with the
factors of each within the range. If the largest or smallest palindrome has more