René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/sum-multiples","name":"#2652 - Sum Multiples - LeetCode JavaScript Solutions","description":"Given a positive integer n, find the sum of all integers in the range [1, n] inclusive that are divisible by 3, 5, or 7. Return an integer d...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number} n\n * @return {number}\n */\nvar sumOfMultiples = function(n) {\n return sumDivisibleBy(3) + sumDivisibleBy(5) + sumDivisibleBy(7)\n - sumDivisibleBy(15) - sumDivisibleBy(21) - sumDivisibleBy(35)\n + sumDivisibleBy(105);\n\n function sumDivisibleBy(divisor) {\n const count = Math.floor(n / divisor);\n return divisor * count * (count + 1) / 2;\n }\n};","keywords":"LeetCode 2652, #2652 - Sum Multiples, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}