Solution to Problem 4

[michaelkamau]

Solution Number: 4

Checklist:

• Created binary in src/bin
• Written Documentation
• Written Tests

What

https://projecteuler.net/problem=4

How

• Finds the largest palindrome made from the product of two n-digit numbers. This is an naive brute-force method. It finds all possible palindromes and then pick the largest one.

[michaelkamau]

Add better documentation

[mattgathu]

Alternative is_palindrome implementation

fn is_palindrome(num: u64) -> bool {
    let num_str: String = format!("{}", num); // 9009-> "9009"
    num_str == num_str.chars().rev().collect::<String>() 
}