-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathFizzBuzz.js
More file actions
35 lines (29 loc) · 859 Bytes
/
FizzBuzz.js
File metadata and controls
35 lines (29 loc) · 859 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
// 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 if non 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"]
const fizzBuzz = function (n) {
const arr = [];
for (let i = 1; i <= n; i++) {
if (i % 15 === 0) {
arr.push("FizzBuzz");
} else if (i % 3 === 0) {
arr.push("Fizz");
} else if (i % 5 === 0) {
arr.push("Buzz");
} else {
arr.push(i.toString());
}
}
return arr;
};