Cody

Problem 235. Project Euler: Problem 4, Palindromic numbers

Solution 3400908

Submitted on 26 Oct 2020 by Predrag Vukovic
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
x = 999; y_correct = 906609; assert(isequal(euler004(x),y_correct))

Largest palindomic product for [999] is 906609 = 993 * 913

2   Pass
x = 9999; y_correct = 99000099; assert(isequal(euler004(x),y_correct))

Largest palindomic product for [9999] is 99000099 = 9999 * 9901

3   Pass
x = 100; y_correct = 9009; assert(isequal(euler004(x),y_correct))

Largest palindomic product for [100] is 9009 = 99 * 91

4   Pass
x = 2500; y_correct = 6167616; assert(isequal(euler004(x),y_correct))

Largest palindomic product for [2500] is 6167616 = 2496 * 2471

Suggested Problems

More from this Author52

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!