Skip to content

learn-co-students/project-euler-largest-palindrome-product-onl01-seng-pt-012120

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

22 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Project Euler

Problem

What is the largest palindrome product of two three-digit numbers?

Background

A palindromic number reads the same both ways. For instance, 101 is a palindrome, as is 91,519 and 1,111.

For example, The largest palindrome made from the product of two two-digit numbers is 9009:

91 * 99
# => 9009

Your objective is to find the largest palindrome made from the product of two three-digit numbers.

Instructions

  • Code your procedural solution into the lib/largest_palindrome_product.rb file.
  • Code your object-oriented solution into the lib/oo_largest_palindrome_product.rb file.
  • Run learn until you get all of the RSpec tests to pass.

Source

View Project Euler on Learn.co and start learning to code for free.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages