Last active
August 29, 2015 13:56
-
-
Save l0gicpath/8994339 to your computer and use it in GitHub Desktop.
Project Euler problem #4 solution in Ruby
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| (100..999).to_a.repeated_permutation(2).collect{|x| x[0] * x[1] if "#{x[0] * x[1]}" == "#{x[0] * x[1]}".reverse }.compact.max |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment