Project Euler 11-20

Created: <2020-08-11 Tue>

Abstract

Project Euler is a collection of math based problems you can try tosolve using a programming language, for fun.

Follow-up, from problem 11 to 20.

Edit: <2021-09-09 Thu> add the Scala 3 Solutions.

Content

Largest Product in a Grid

Problem: Largest Product in a Grid

Solution Haskell:

Solution Scala:

Highly Divisible Triangular Number

Problem: Highly Divisible Triangular Number

Solution Haskell:

Solution Scala:

Note that find function from Data.List is more inefficientthen using the handmade, recursive function I used. Just trySomething like

fromJust $ find ((==500) . length . findDivisors) triangleNumbers

and you will see it hangs, never returning

Large Sum

Problem: Large Sum

Solution Haskell:

Solution Scala:

Largest Collatz Sequesnce

Problem: Largest Collatz Sequnece

Solution Haskell:

Solution Scala:

Lattice Path

Problem: Lattice Path

Solution Haskell:

Solution Scala:

Power Digit Sum

Problem: Power Digit Sum

Solution Haskell:

Solution Scala:

Number Letter Count

Problem: Number Letter Count

Solution Haskell:

Solution Scala:

Maximum Path Sum I

Problem: Maximum Path Sum I

Solution Haskell:

Solution Scala:

Counting Sundays

Problem: Counting Sundays

Solution Haskell:

Solution Scala:

Factorial Digit Sum

Problem: Factorial Digit Sum

Solution Haskell:

Solution Scala:

Conclusions

learning never ends 😃

Blog

Articles