What is JavaScript and How It Powers Modern Websites
What is JavaScript? Discover how this quirky yet powerful language runs in browsers, what makes it tick, and how you can start adding it to your sites
The Introvert Coder | Quietly Building Loud Code!
Quietly Building Loud Code!
Latest articles
Project Euler: #17 - Number letter counts
Problem 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...
Project Euler: #16 - Power digit sum
Problem 215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the sum of the digits of the number 21000? Problem Description The problem is pretty self-explanatory. 215 is 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26....
Project Euler: #15 - Lattice paths
Problem 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...
Project Euler: #14 - Longest Collatz sequence
Problem 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 → ...
Project Euler: #13 - Large sum
Problem Work out the first ten digits of the sum of the following one-hundred 50-digit numbers. 37107287533902102798797998220837590246510135740250 46376937677490009712648124896970078050417018260538 74324986199524741059474233309513058123726617309629 9...
Project Euler: #12 - Highly divisible triangular number
Problem 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...
Find Proper Divisors of integer 'n'
Problem: Divisors of 'n' Given a positive integer n. Find all the proper divisors of the integer n. Approach We can approach this in two ways. Brute force method Squareroot of n method Brute force method: The most basic approach is to apply the b...
Project Euler: #11 - Largest product in a grid
Problem 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 ...