My solutions to algorithmic problems in interviewbit written in C++
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 |
- Fork the repository
- Do the desired changes (add/delete/modify)
- Make a pull request
- If there is no solution to a problem in the main branch.
- If your solution is asymptotically faster than the one in the main branch.
- 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.
- 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.
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 abhisheksharma.0517@gmail.com.