This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// The concept of self-executing functions | |
// 1. Basic self-executing functions for encapsulation | |
// | |
// Suppose you have some JS code like this: | |
var foo = "inner"; | |
console.log(foo); | |
// You worry that the external world may also have defined a foo variable. | |
// To protect your code, you can encapsulate it by putting it in a |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Find the total amount of absolute values | |
*/ | |
function huntBats(b){ | |
console.log(b + " = "); | |
function detect(b){ | |
for( var i = 0 ; i < b.length ; i++ ){ | |
if( b[i]<0) b[i] = b[i] * -1; //normalize |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var deck = []; | |
function createDeck(cardQty){ | |
for(var i = 0; i < cardQty; i++){ | |
deck[i] = i + 1; | |
} | |
} | |
function shuffle(deck){ | |
var deckShuffled = []; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
euler | |
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. | |
The sum of these multiples is 23. | |
Find the sum of all the multiples of 3 or 5 below 1000. | |
*/ | |
//loop through each number until reaching naturalNumberQty | |
function sumMultiplesOf3And5(naturalNumberQty){ | |
sumOfMultiples = 0; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
euler | |
Each new term in the Fibonacci sequence is generated by adding the previous two terms. | |
By starting with 1 and 2, the first 10 terms will be: | |
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... | |
By considering the terms in the Fibonacci sequence whose values do not exceed four million, | |
find the sum of the even-valued terms. | |
*/ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
The prime factors of 13195 are 5, 7, 13 and 29. | |
What is the largest prime factor of the | |
number 600851475143 ? | |
*/ | |
function getPrime(n){ | |
var aPrimes = [], max = 0; | |
function primeTest(d){ | |
//test the divisor to see if it's prime |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
A palindromic number reads the same both ways. | |
The largest palindrome made from the product of | |
two 2-digit numbers is 9009 = 91 × 99. | |
Find the largest palindrome made from the product | |
of two 3-digit numbers. | |
*/ | |
function findLargestPalindrome(n){ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
2520 is the smallest number that can be divided by | |
each of the numbers from 1 to 10 without any remainder. | |
What is the smallest positive number that is evenly | |
divisible by all of the numbers from 1 to 20? | |
*/ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var s = '7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450' | |
var getProdu |
OlderNewer