Add solution #412

Author: JoshCrozier

README.md

@@ -164,6 +164,7 @@
 383|[Ransom Note](./0383-ransom-note.js)|Easy|
 387|[First Unique Character in a String](./0387-first-unique-character-in-a-string.js)|Easy|
 405|[Convert a Number to Hexadecimal](./0405-convert-a-number-to-hexadecimal.js)|Easy|
+412|[Fizz Buzz](./0412-fizz-buzz.js)|Easy|
 414|[Third Maximum Number](./0414-third-maximum-number.js)|Easy|
 419|[Battleships in a Board](./0419-battleships-in-a-board.js)|Medium|
 442|[Find All Duplicates in an Array](./0442-find-all-duplicates-in-an-array.js)|Medium|

solutions/0412-fizz-buzz.js

@@ -0,0 +1,22 @@
+/**
+ * 412. Fizz Buzz
+ * https://leetcode.com/problems/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.
+ */
+
+/**
+ * @param {number} n
+ * @return {string[]}
+ */
+var fizzBuzz = function(n) {
+  return Array.from(new Array(n), (_, i) => i + 1).map(i =>
+    i % 3 === 0 && i % 5 === 0
+      ? 'FizzBuzz' : i % 3 === 0 ? 'Fizz' : i % 5 === 0 ? 'Buzz' : String(i)
+  );
+};