@YipCubed/

# leet-fizz-buzz

## No description

Files
• main.cpp
main.cpp
```1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
```
```#include <cstring>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>

using namespace std;

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "[";
for (T i : v) {
os << i << " ";
}
os << "]";
return os;
}

// Live coding problems, watch at
// https://www.twitch.tv/yipcubed
//

// makes code faster, but larger. Just for LeetCode fun!
#pragma GCC optimise ("Ofast")

// makes stdin not synced so it is faster. Just for LeetCode fun!
static auto x = [](){ios_base::sync_with_stdio(false); cin.tie(NULL); return NULL;}();

class Solution {
public:
vector<string> fizzBuzz(int n) {
vector<string> s;
for (int i = 1; i <= n; ++i) {
if (i % 15 == 0)
s.push_back("FizzBuzz");
else if (i % 5 == 0)
s.push_back("Buzz");
else if (i % 3 == 0)
s.push_back("Fizz");
else
s.push_back(to_string(i));
}
return s;
}
};

void test1() {
Solution S;
vector<string> v =  S.fizzBuzz(15);
cout << " 15? " << v << endl;
}

void test2() {
Solution S;
}

void test3() {
Solution S;
}

int main() {
test1();
test2();
test3();
cout << "Done!" << endl;

return 0;
}

```