Joseph Jude

My solutions to Project Euler problems

2016.05.02 / euler / swift / tsc / python /

My solutions to Project Euler problems

This page lists my solutions to project euler problems. I do this to learn. Through this exercise, I hope to learn algorithms and three languages (swift, python, and typescript). Solutions are available here in the site and at github. Feel free to clone the Git repository. If you need any clarification, tweet me.

  1. 001: Find the sum of all the multiples of 3 or 5 below 1000
  2. 002: Sum of even valued Fibonacci numbers less than 4 million
  3. 003: Largest prime factor of the number 600851475143
  4. 004: Largest palindrome made from the product of two 3-digit numbers

Share this post on

Twitter | | |