Need help with InterviewBit-Topicwise-Solutions?
Click the “chat” button below for chat support from the developer who created it, or find similar developers for support.

About the developer

178 Stars 140 Forks 141 Commits 3 Opened issues


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.

Services available


Need anything else?

Contributors list

No Data


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| 78| | Backtracking| 22| | Binary Search| 22| | Bit Manipulation| 10| | Codersbit| 19| | Dynamic Programming| 95| | Graphs| 43| | Greedy| 15| | Hashing| 36| | Heaps And Maps| 25| | Linked Lists| 26| | Math| 56| | Stacks And Queues| 27| | Strings| 36| | Time Complexity| 30| | Trees| 66| | Two Pointers| 26|

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 [email protected].

We use cookies. If you continue to browse the site, you agree to the use of cookies. For more information on our use of cookies please see our Privacy Policy.