# FizzBuzz - Amazon Top Interview Questions

### Problem Statement :

Given an integer n, return a list of integers from 1 to n as strings except for multiples of 3 use “Fizz” instead of the integer and for the multiples of 5 use “Buzz”. For integers which are multiples of both 3 and 5 use “FizzBuzz”.

Constraints

0 ≤ n ≤ 100,000

Example 1

Input

n = 15

Output

["1", "2", "Fizz", "4", "Buzz", "Fizz", "7", "8", "Fizz", "Buzz", "11", "Fizz", "13", "14", "FizzBuzz"]

### Solution :

Solution in C++ :

vector<string> solve(int n) {
vector<string> res;
for (int i = 1; i <= n; i++) {
string s;
if (i % 3 == 0) s += "Fizz";
if (i % 5 == 0) s += "Buzz";

res.push_back(s.empty() ? to_string(i) : s);
}
return res;
}

Solution in Java :

import java.util.*;

class Solution {
public String[] solve(int n) {
String s[] = new String[n];
s[0] = "1";
for (int i = 1; i < s.length; i++) {
if ((i + 1) % 3 == 0 && (i + 1) % 5 == 0) {
s[i] = "FizzBuzz";
} else if ((i + 1) % 3 == 0) {
s[i] = "Fizz";
} else if ((i + 1) % 5 == 0) {
s[i] = "Buzz";
} else {
s[i] = String.valueOf(i + 1);
}
}
return s;
}
}

Solution in Python :

class Solution:
def solve(self, n):
# return [self.convert_int(i) for i in range(1, n + 1)]
return [
"FizzBuzz" if not i % 15 else "Buzz" if not i % 5 else "Fizz" if not i % 3 else str(i)
for i in range(1, n + 1)
]

## 2D Array-DS

Given a 6*6 2D Array, arr: 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 An hourglass in A is a subset of values with indices falling in this pattern in arr's graphical representation: a b c d e f g There are 16 hourglasses in arr. An hourglass sum is the sum of an hourglass' values. Calculate the hourglass sum for every hourglass in arr, then print t

## Dynamic Array

Create a list, seqList, of n empty sequences, where each sequence is indexed from 0 to n-1. The elements within each of the n sequences also use 0-indexing. Create an integer, lastAnswer, and initialize it to 0. There are 2 types of queries that can be performed on the list of sequences: 1. Query: 1 x y a. Find the sequence, seq, at index ((x xor lastAnswer)%n) in seqList.

## Left Rotation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d

## Sparse Arrays

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun

## Array Manipulation

Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu

## Print the Elements of a Linked List

This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode