Javascript (easy to read solution)
Intuition\nBuild string based on condition.\n\n# Approach\nStart with an empty array. Loop through each letter starting from the beginning. First check divisibi
# Intuition\nBuild string based on condition.\n\n# Approach\nStart with an empty array. Loop through each letter starting from the beginning. First check divisibility by 3, then 5. This allows string concatenation for "FizzBuzz". Have a catch statement for if the string is empty, to push the number.\n\n# Complexity\n- Time complexity:\nO(n): n being the input integer. The function iterates \'n\' times to calculate the result. \n\n- Space complexity:\nO(n): Our final answer is an array that is proportional to the input number and grows linearly.\n\n# Code\n```\nconst fizzBuzz = (n) => {\n    let res = []\n\n    for (let i = 1; i <= n; i++){\n        let string = \'\'\n        if (i % 3 === 0) string += \'Fizz\'\n        if (i % 5 === 0) string += \'Buzz\'\n\n        if (string === \'\') string += i\n        res.push(string)\n    }\n\n\n    return res\n};\n```
['JavaScript']