Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 412 with 12 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 412 # by problem number
lcpy gen -s fizz_buzz # by problem name
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.Input: n = 3
Output: ["1","2","Fizz"]
Input: n = 5
Output: ["1","2","Fizz","4","Buzz"]
Input: n = 15
Output: ["1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","14","FizzBuzz"]
class Solution:
# Time: O(n)
# Space: O(1) extra (output not counted)
def fizz_buzz(self, n: int) -> list[str]:
return [
"FizzBuzz"
if i % 15 == 0
else "Fizz"
if i % 3 == 0
else "Buzz"
if i % 5 == 0
else str(i)
for i in range(1, n + 1)
]
| Time | Space |
|---|---|
| O(n) | O(1) extra (output not counted) |