Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit 6bf926a

Browse files
committed
Added cle12 exercise solutions
1 parent 0b7a0a0 commit 6bf926a

File tree

6 files changed

+55
-4
lines changed

6 files changed

+55
-4
lines changed

README.md

Lines changed: 21 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,10 +3,30 @@
33
![Interviewbit](images/logo.png)
44

55

6-
## What you can find in this repository
6+
## What you can find in this repository ---- daily updates
77

88
You will find notes about compeititve programming, time and space analysis, algorithm and data structures and advices that I have matured during my experience and studies.
99

10+
| Name | Number of solutions |
11+
|----------|:----------------:|
12+
|[Array](array/README.md)|1|
13+
|[Time Complexity](time-complexity/README.md)|7|
14+
|[ ]( )| |
15+
|[ ]( )| |
16+
|[ ]( )| |
17+
|[ ]( )| |
18+
|[ ]( )| |
19+
|[ ]( )| |
20+
|[ ]( )| |
21+
|[ ]( )| |
22+
|[ ]( )| |
23+
|[ ]( )| |
24+
|[ ]( )| |
25+
|[ ]( )| |
26+
|[ ]( )| |
27+
|[ ]( )| |
28+
|[ ]( )| |
29+
1030
I have solved quite a number of problems from several topics. See the below table for further details.
1131
[View my profile](https://www.interviewbit.com/profile/omonimus1)
1232

array/README.MD

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,4 @@
1+
# Arrays
2+
| Name |Answer |
3+
|----------|:----------------:|
4+
|[Fizzbuzz](https://www.interviewbit.com/problems/fizzbuzz/)| [C++](fizzbuzz.cpp) |

array/fizzbuzz.cpp

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
vector<string> Solution::fizzBuzz(int A) {
2+
vector<string>solution;
3+
for(int i=1; i<=A; i++)
4+
{
5+
if(i % 3 == 0 && i % 5== 0)
6+
solution.push_back("FizzBuzz");
7+
else if(i % 3 == 0)
8+
solution.push_back("Fizz");
9+
else if (i % 5 == 0)
10+
solution.push_back("Buzz");
11+
else
12+
solution.push_back(to_string(i));
13+
}
14+
return solution;
15+
}

databases/README.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
DATABASES solutions
2+
3+
| Name |Answer |
4+
|----------|:----------------:|
5+
|[Neutral Reviewers](https://www.interviewbit.com/problems/neutral-reviewers/)| [SQL](reviewers.sql) |

databases/reviewers.sql

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,3 @@
1+
SELECT reviewers.reviewer_name
2+
FROM reviewers , ratings
3+
WHERE (reviewers.reviewer_id = ratings.reviewer_id) AND reviewer_stars IS NULL;

time-complexity/time-complexity.md

Lines changed: 7 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,11 @@
77
|[reccmpl](https://www.interviewbit.com/problems/reccmpl1/) |O(N|
88
|[nesteccmpll](https://www.interviewbit.com/problems/nestedcmpl/) |O(N * N) time, O(1) space|
99
|[nestedcmpl2](interviewbit.com/problems/nestedcmpl2/) |O(N*N)|
10+
|[Nestedcmptl3](https://www.interviewbit.com/problems/nestedcmpl3/) |O(N)|
1011
|[Choose 4](https://www.interviewbit.com/problems/choose4/) | X will always be a better choice for large inputs |
11-
|[]() | |
12-
|[]() | |
13-
|[]() | |
12+
|[loopcmd2](https://www.interviewbit.com/problems/loopcmpl2/) | O(N logN) |
13+
|[Choose1](https://www.interviewbit.com/problems/choose1/) | n^3 / (sqrt(n))|
14+
15+
16+
17+

0 commit comments

Comments
 (0)