A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99.
Find the largest palindrome made from the product of numbers less than or equal to the input number.
Solution Stats
Problem Comments
6 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers1275
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6749 Solvers
-
Back to basics 21 - Matrix replicating
1806 Solvers
-
Change the sign of even index entries of the reversed vector
648 Solvers
-
522 Solvers
-
Replace Nonzero Numbers with 1
446 Solvers
More from this Author51
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Your last test case is accidentally all commented out, so isn't a real test case
The question is unclear. Do the factor-numbers all have to be two-digited?
@Jan-Andrea Bard, no.
Although it is not mentioned clearly in the problem statement but you can see a hint from the test suite
This problem would be really fun with larger test cases. It would eliminate kron() and stop naively checking every string combination.
@Brandon you could submit a new problem ("Palindromic Numbers - Hard Mode" or so).
Hello,
Just want to make a correction and make a clear problem statement. It is missing a multiplication sign.
"A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99."
Modified to be,
"A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 * 99."