The repository contains solutions to various coding Competitive Programming sites like Leetcode, Hackerrank , Hackearth, Pramp, AlgoExpert & EPI . I've tried to provide the detailed solution and the intution through comments.
These questions are classical problems that are most frequently asked by the tech giants in technical interviews and are
not related to hard core competitive coding.
All the code provided inside the repository is purely original and completely my own.
| Type | Notation | Time Complexities Resources | Space Complexities Resources |
|---|---|---|---|
| Constant | O(1) | https://www.interviewcake.com/article/python/big-o-notation-time-and-space-complexity? | |
| Linear | O(n) | https://www.interviewcake.com/article/python/big-o-notation-time-and-space-complexity? | |
| Logarithm | O(Log n) | https://www.interviewcake.com/article/python/logarithms? https://www.youtube.com/watch?v=M4ubFru2O80 | |
| Quadratic | O(n*n) | https://www.interviewcake.com/article/python/big-o-notation-time-and-space-complexity? |
- Hackerrank
- Leetcode
Includes both Biweekly and Weekly contest.- Google Kickstart
- CodeForces
- Design Library Management System
- Design Parking Lot
- Design Call Center
- Design Hit Counter
- Design Linux Find Command
- Design ATM
- Design Movie Ticket System
- Design Pharmacy Shop
TODO
- Fork the repository
- Do the desired changes (add/delete/modify)
- Make a pull request
- If there is no solution to a problem.
- 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 it would be better to, comment out the original solution and make a pull request with your solution.