fn is_palindrome(num: i32) -> bool {
let mut temp = num;
let mut rev = 0;
while temp > 0 {
rev = rev * 10 + (temp % 10);
temp /= 10;
}
rev == num
}
fn get_largest_palindrome_of_two_2_digit_numbers() -> i32 {
let mut largest_palindrome = 0;
for i in 10..100 {
for j in 10..100 {
let product = i * j;
if is_palindrome(product) && product > largest_palindrome {
largest_palindrome = product;
}
}
}
largest_palindrome
}
fn main() {
println!(
"The largest palindrome made from the product of two 2-digit numbers is: {}",
get_largest_palindrome_of_two_2_digit_numbers()
);
}
/*
run:
The largest palindrome made from the product of two 2-digit numbers is: 9009
*/
