Journal Archive

2022

/**
 * @param {number} n
 * @return {string[]}
 */
var fizzBuzz = function(n) {
    const answer = [];
    for (let i = 1; i <= n; i++) {
        let word = "";
        if (i % 3 === 0) {
            word += "Fizz";
        }
        if (i % 5 === 0) {
            word += "Buzz";
        }
        if (word === "") {
            word += i;
        }
        
        answer.push(word);
        
    }
    return answer;
};

Day 84: Solving one of LeetCode problems

412. Fizz Buzz Difficulty - Easy

Given an integer n, return a string array answer (1-indexed) where:

  • answer[i] == "FizzBuzz" if i is divisible by 3 and 5.
  • answer[i] == "Fizz" if i is divisible by 3.
  • answer[i] == "Buzz" if i is divisible by 5.
  • answer[i] == i (as a string) if none of the above conditions are true.

 

Example 1:

Input: n = 3
Output: ["1","2","Fizz"]

Example 2:

Input: n = 5
Output: ["1","2","Fizz","4","Buzz"]

Example 3:

Input: n = 15
Output: ["1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","14","FizzBuzz"]