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 two 3-digit numbers.
This is a Project Euler Problem: https://projecteuler.net/problem=4
These questions can be solved in either Java , Python
Rust, C++, Go or !
However, the language intended for these questions is mentioned along with the question on the top.
You need to submit the solution file for the autograder to grade the submission.
If you are submitting in Java, make sure that the class name is Main (with a capital M)