Problem 235. Project Euler: Problem 4, Palindromic numbers
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
-
5 Comments
Show
2 older comments
Dyuman Joshi
on 2 Nov 2021
@Jan-Andrea Bard, no.
Although it is not mentioned clearly in the problem statement but you can see a hint from the test suite
Brandon
on 22 May 2023
This problem would be really fun with larger test cases. It would eliminate kron() and stop naively checking every string combination.
Christian Schröder
on 24 Dec 2023
@Brandon you could submit a new problem ("Palindromic Numbers - Hard Mode" or so).
Solution Comments
Show commentsGroup

Basics - Cell Arrays
- 10 Problems
- 1277 Finishers
- Cell joiner
- Create a cell array out of a struct
- Convert a numerical matrix into a cell array of strings
- Split a string into chunks of specified length
- Convert a Cell Array into an Array
- Remove element(s) from cell array
- Cell Counting: How Many Draws?
- String Array Basics, Part 1: Convert Cell Array to String Array; No Missing Values
- Fix the last element of a cell array
- Natural numbers in string form
Problem Recent Solvers1157
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!