-
-
Save guioconnor/1951552 to your computer and use it in GitHub Desktop.
Find the sum of all the multiples of 3 or 5 below 1000.
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
// Do the maths | |
for( | |
var sum = 0, i = 1; | |
i < 1000; | |
!(i % 3 && i % 5) && (sum += i), i++ | |
); | |
// Log the result | |
console.log(sum); |
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
// Prep the array | |
for( | |
var arr = [], i = 1; | |
i < 1000; | |
!(i % 3 && i % 5) && arr.push(i), i++ | |
); | |
// Sum the array | |
console.log( | |
arr.reduce( | |
function(prev, current) { | |
return prev + current | |
} | |
) | |
); |
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
print sum([i for i in range(1000) if not (i % 3 and i % 5)]) |
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
puts (1...1000).select{ |n| n % 3 == 0 || n % 5 == 0 }.reduce(:+) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment