{ "componentChunkName": "component---src-templates-blog-post-js", "path": "/solving-the-classic-fizzbuzz-problem-in-javascript/", "result": {"data":{"markdownRemark":{"html":"

Problem statement

\n

Write a program that console logs numbers from 1 to n. But the program should print fizz if a number is divisible by 3, buzz if divisible by 5 and fizzbuzz if divisible by both 3 & 5.

\n

Solution

\n

The only knowledge you need to solve this problem is the knowledge of the JavaScript remainder operator.

\n
const fizzbuzz = num => {\n  for (let i = 1; i <= num; i++) {\n    if (i % 3 === 0 && i % 5 === 0) {\n      console.log("fizzbuzz")\n    } else if (i % 3 === 0) {\n      console.log("fizz")\n    } else if (i % 5 === 0) {\n      console.log("buzz")\n    } else {\n      console.log(i)\n    }\n  }\n}\n\nfizzbuzz(15)\n// 1\n2\nfizz\n4\nbuzz\nfizz\n7\n8\nfizz\nbuzz\n11\nfizz\n13\n14\nfizzbuzz
\n","frontmatter":{"title":"Solving the Classic FizzBuzz Problem in JavaScript","date":"2021-07-15"}}},"pageContext":{"slug":"/solving-the-classic-fizzbuzz-problem-in-javascript/","prev":{"fields":{"slug":"/array-chunking-in-javascript-using-while-loop-and-slice-method/"},"frontmatter":{"modules":null}},"next":{"fields":{"slug":"/2-ways-to-check-whether-a-string-is-a-palindrome-in-javascript/"},"frontmatter":{"modules":null}}}}, "staticQueryHashes": ["3159585216"]}