Home
Insert
Update snippet 'Largest Palindrome Number from Product of Two Three Digit Numbers'
Title
Description
Here is an improved version twice shorter, than original
Source code
let cartesianProduct l1 l2 = List.map (fun x -> (List.map (fun y -> x * y) l2)) l1 |> List.concat let isPalindromic n = let isAnagram (s: string) = new string(s.ToCharArray() |> Array.rev) = s isAnagram(string n) cartesianProduct [999..-1..100] [999..-1..100] |> List.filter isPalindromic |> List.max |> printfn "Project Euler Problem 4 Answer: %d"
Tags
sequence
project euler problem
sequence
project euler problem
Author
Link
Reference NuGet packages
If your snippet has external dependencies, enter the names of NuGet packages to reference, separated by a comma (
#r
directives are not required).
Update