Is Fizz Buzz easy or hard?

Fizz Buzz is classified as an easy problem. The challenge focuses on implementing simple conditional logic and loops correctly rather than advanced algorithms or data structures.

How to solve Fizz Buzz in O(n)?

Loop through numbers from 1 to n and apply divisibility rules using modulo operations. If a number is divisible by both 3 and 5 output "FizzBuzz", if only by 3 output "Fizz", if only by 5 output "Buzz", otherwise output the number as a string. The single pass over the range guarantees O(n) time complexity.

Fizz Buzz Python or Java solution?

Both Python and Java solutions follow the same logic: iterate from 1 to n and check divisibility using the modulo operator. Python typically builds a list of strings, while Java uses an ArrayList . Each implementation runs in O(n) time with constant auxiliary space.

What is the best approach for Fizz Buzz?

The standard solution is simple iteration with condition checks. Iterate from 1 to n and use modulo operations to test divisibility by 3 and 5. This runs in O(n) time with O(1) auxiliary space and is the approach most interviewers expect.

What data structure is used in Fizz Buzz?

Most implementations only use a result array or list to store the output strings. Some variations use a small hash map that maps divisors (like 3 and 5) to words ("Fizz", "Buzz") to make the rule system easier to extend.

What is the time complexity of Fizz Buzz?

Fizz Buzz runs in O(n) time because the algorithm processes each number from 1 through n exactly once. Each step performs constant-time modulo checks and string operations, so the total runtime scales linearly with n.

Is Fizz Buzz asked at Google, Amazon, or Meta?

Fizz Buzz itself is usually used as a screening or warm‑up question rather than a core interview problem. Companies like Google, Amazon, and Meta have historically used it to verify that candidates can write correct loops, conditions, and basic logic before moving to harder algorithm questions.

Description Solution Video 5:55

412. Fizz Buzz

Easy75.9% acceptance18 companies

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.

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"]

Constraints:

1 <= n <= 10⁴

Asked at 18 companies

IBM

Mastercard NVIDIA Citadel

Cisco Amazon Meta JPMorgan Chase Agoda

Google Microsoft Bloomberg

+6 more

Apple

TCS PayPal Capital One Uber Goldman Sachs

Topics

5:55

Still stuck?Read 3 approaches, or watch a walkthrough.

Open solution

412. Fizz Buzz

Asked at 18 companies

Topics

Similar problems