Skip to content

ascyphermoonshot/Largest-palindrome-product

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 

Repository files navigation

Largest-palindrome-product

This spaghetti code is a bruteforce approach to the fourth problem from Project Euler. A palindromic number reads the same both ways, this program is defined to output the largest palindrome number that can be obtained from multiplication of 2 3-digit numbers.

The next step is to let the user choose the number of digits.

About

This spaghetti code is a bruteforce approach to the fourth problem from Project Euler

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages