jogendra / Interview-bit-Topic-wise-Solutions

The repository contains solutions to various problems on interviewbit. The code is merely a snippet (as solved on InterviewBit) & hence is not executable in a c++ compiler. The code written is purely original and completely my own.

Interview-bit-Topic-wise-Solutions

My solutions to algorithmic problems in interviewbit written in C++

What you can find in this repository

I have solved quite a number of problems from several topics. See the below table for further details.

Topic Name	Number of Problems Solved
Arrays	32
Backtracking	15
Binary Search	12
Bit Manipulation	7
Dynamic Programming	48
Graphs	17
Greedy	7
Hashing	14
Heaps And Maps	6
Linked Lists	17
Math	23
Stacks And Queues	10
Strings	22
Time Complexity	15
Trees	30
Two Pointers	15

How to contribute?

1. Fork the repository
2. Do the desired changes (add/delete/modify)
3. Make a pull request

When to contribute?

1. If there is no solution to a problem in the main branch.
2. If your solution is asymptotically faster than the one in the main branch.
3. If your algorithm is of the same time complexity but with reduced code size. In this case, comment out the original solution and make a pull request with your solution.
4. If you have another method of solving the problem which is asymptotically slower than the original method then, comment your solution in the main file and make a pull request.

What I'll be doing with this repository

One day in the foreseeable future I will have solved all the challenges on interviewbit. Then this repository will mostly become a static one.

Constructive criticisms or code reviews of any kind are very much welcome.

If you have any questions about the solutions you can find here, feel free to contact me [e-mail].