Sangy K (SK) | The Introvert Coderblog.theintrovertcoder.in·Jan 18, 2023Project Euler: #17 - Number letter countsProblem If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total. If all the numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many letters w...51 readsProject Euler: JS Solution Explained!2Articles1Week
Sangy K (SK) | The Introvert Coderblog.theintrovertcoder.in·Jan 16, 2023Project Euler: #15 - Lattice pathsProblem Starting in the top left corner of a 2*2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner. How many such routes are there through a 20*20 grid? Problem Description We are given a...31 readsProject Euler: JS Solution Explained!Project Euler
Sangy K (SK) | The Introvert Coderblog.theintrovertcoder.in·Jan 15, 2023Project Euler: #14 - Longest Collatz sequenceProblem The following iterative sequence is defined for the set of positive integers: n → n/2 (n is even) n → 3n + 1 (n is odd) Using the rule above and starting with 13, we generate the following sequence: 13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → ...72 readsProject Euler: JS Solution Explained!Project Euler
Sangy K (SK) | The Introvert Coderblog.theintrovertcoder.in·Jan 14, 2023Project Euler: #13 - Large sumProblem Work out the first ten digits of the sum of the following one-hundred 50-digit numbers. 37107287533902102798797998220837590246510135740250 46376937677490009712648124896970078050417018260538 74324986199524741059474233309513058123726617309629 9...Project Euler: JS Solution Explained!Project Euler
Sangy K (SK) | The Introvert Coderblog.theintrovertcoder.in·Jan 13, 2023Project Euler: #12 - Highly divisible triangular numberProblem The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be: 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ... Let us list the factors of...Project Euler: JS Solution Explained!Project Euler
Sangy K (SK) | The Introvert Coderblog.theintrovertcoder.in·Jan 11, 2023Project Euler: #11 - Largest product in a gridProblem In the 20×20 grid below, four numbers along a diagonal line have been marked in yellow. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 0849 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 0081 49 31 73 55 79 14 29 93 71 40 67 ...Project Euler: JS Solution Explained!Project Euler
Sangy K (SK) | The Introvert Coderblog.theintrovertcoder.in·Jan 10, 2023Project Euler: #10 - Summation of primesProblem The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million. Problem Description The problem is pretty self-explanatory! Sum of primes below 10 is 17. Find the sum of primes below 2000000. Approach...Project Euler: JS Solution Explained!Project Euler
Sangy K (SK) | The Introvert Coderblog.theintrovertcoder.in·Jan 9, 2023Project Euler: #9 - Special Pythagorean tripletProblem A Pythagorean triplet is a set of three natural numbers, a < b < c for which, $$a^2 + b^2 = c^2$$ For example, $$3^2 + 4^2 = 9 + 16 = 25 = 5^2$$ There exists exactly one Pythagorean triplet for which a + b + c = 1000.Find the product abc. Pr...29 readsProject Euler: JS Solution Explained!Project Euler
Sangy K (SK) | The Introvert Coderblog.theintrovertcoder.in·Jan 8, 2023Project Euler: #8 - Largest product in a seriesProblem The four adjacent digits in the 1000-digit number that has the greatest product is 9 × 9 × 8 × 9 = 5832. 73167176531330624919225119674426574742355349194934969835203127745063262395783180169848018694788518438586156078911294949545950173795833195...160 readsProject Euler: JS Solution Explained!Project Euler
Sangy K (SK) | The Introvert Coderblog.theintrovertcoder.in·Jan 7, 2023Project Euler: #7 - 10001st primeProblem By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10001st prime number? Problem Description We all know about Prime Numbers. A number that is divisible by 1 and itself is called ...160 readsProject Euler: JS Solution Explained!Project Euler
