Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 18.4 MB (11.78%)

Author: jimit105

0412-fizz-buzz/README.md

@@ -0,0 +1,26 @@
+<p>Given an integer <code>n</code>, return <em>a string array </em><code>answer</code><em> (<strong>1-indexed</strong>) where</em>:</p>
+
+<ul>
+	<li><code>answer[i] == &quot;FizzBuzz&quot;</code> if <code>i</code> is divisible by <code>3</code> and <code>5</code>.</li>
+	<li><code>answer[i] == &quot;Fizz&quot;</code> if <code>i</code> is divisible by <code>3</code>.</li>
+	<li><code>answer[i] == &quot;Buzz&quot;</code> if <code>i</code> is divisible by <code>5</code>.</li>
+	<li><code>answer[i] == i</code> (as a string) if none of the above conditions are true.</li>
+</ul>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<pre><strong>Input:</strong> n = 3
+<strong>Output:</strong> ["1","2","Fizz"]
+</pre><p><strong class="example">Example 2:</strong></p>
+<pre><strong>Input:</strong> n = 5
+<strong>Output:</strong> ["1","2","Fizz","4","Buzz"]
+</pre><p><strong class="example">Example 3:</strong></p>
+<pre><strong>Input:</strong> n = 15
+<strong>Output:</strong> ["1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","14","FizzBuzz"]
+</pre>
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n &lt;= 10<sup>4</sup></code></li>
+</ul>

0412-fizz-buzz/solution.py

@@ -0,0 +1,26 @@
+# Approach 3: Hash it
+
+# Time: O(n)
+# Space: O(1)
+
+class Solution:
+    def fizzBuzz(self, n: int) -> List[str]:
+        ans = []
+
+        fizz_buzz_dict = {3: 'Fizz', 5: 'Buzz'}
+        divisors = [3, 5]
+
+        for num in range(1, n + 1):
+            num_ans_str = []
+
+            for key in divisors:
+                if num % key == 0:
+                    num_ans_str.append(fizz_buzz_dict[key])
+
+            if not num_ans_str:
+                num_ans_str.append(str(num))
+
+            ans.append(''.join(num_ans_str))
+
+        return ans
+