royalpranjal / Interview Bit
Licence: mit
Solutions to problems on Interview Bit
Stars: ✭ 353
Projects that are alternatives of or similar to Interview Bit
The Uplift Project Dsa
Stars: ✭ 20 (-94.33%)
Mutual labels: algorithms, data-structures, algorithm-challenges
Competitive coding
This repository contains some useful codes, techniques, algorithms and problem solutions helpful in Competitive Coding.
Stars: ✭ 393 (+11.33%)
Mutual labels: algorithms, data-structures, algorithm-challenges
Java
All Algorithms implemented in Java
Stars: ✭ 42,893 (+12050.99%)
Mutual labels: algorithms, algorithm-challenges, data-structures
Get better at cp in 2 months
This contains the curriculum that I will follow to get better at Competitive Programming in 2 months.
Stars: ✭ 627 (+77.62%)
Mutual labels: algorithms, data-structures, algorithm-challenges
Algos
Popular Algorithms and Data Structures implemented in popular languages
Stars: ✭ 966 (+173.65%)
Mutual labels: algorithms, data-structures, algorithm-challenges
C
Collection of various algorithms in mathematics, machine learning, computer science, physics, etc implemented in C for educational purposes.
Stars: ✭ 11,897 (+3270.25%)
Mutual labels: algorithms, data-structures, algorithm-challenges
Hackerrank
📗 Solutions of more than 380 problems of Hackerrank accross several domains.
Stars: ✭ 128 (-63.74%)
Mutual labels: algorithms, data-structures, algorithm-challenges
Coding Interview University
A complete computer science study plan to become a software engineer.
Stars: ✭ 204,859 (+57933.71%)
Mutual labels: algorithms, data-structures
Mega Interview Guide
The MEGA interview guide, JavaSciript, Front End, Comp Sci
Stars: ✭ 255 (-27.76%)
Mutual labels: algorithms, data-structures
Algorithms.js
Atwood's Law applied to CS101 - Classic algorithms and data structures implemented in JavaScript
Stars: ✭ 3,322 (+841.08%)
Mutual labels: algorithms, data-structures
Algowiki
A wiki dedicated to competitive programming
Stars: ✭ 317 (-10.2%)
Mutual labels: algorithms, data-structures
Javascript Algorithms
📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings
Stars: ✭ 133,406 (+37692.07%)
Mutual labels: algorithms, data-structures
Fucking Algorithm
刷算法全靠套路，认准 labuladong 就够了！English version supported! Crack LeetCode, not only how, but also why.
Stars: ✭ 99,705 (+28145.04%)
Mutual labels: algorithms, data-structures
Interviews
Everything you need to know to get the job.
Stars: ✭ 54,875 (+15445.33%)
Mutual labels: algorithms, algorithm-challenges
Php
All Algorithms implemented in Php
Stars: ✭ 272 (-22.95%)
Mutual labels: algorithms, data-structures
Interview Techdev Guide
This repository contains curated technical interview questions by fn+geeks community
Stars: ✭ 252 (-28.61%)
Mutual labels: algorithms, data-structures
Cpp
Repository for C++/C codes and algos.
Stars: ✭ 265 (-24.93%)
Mutual labels: algorithms, data-structures
Interviewbit solutions
General Information
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 & completely my own.
The solutions for the following types of questions are available :-
How to contribute?
- Fork the repository
- Do the desired changes (add/delete/modify)
- Make a pull request
When to contribute?
- 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 & 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 & make a pull request.
Note that the project description data, including the texts, logos, images, and/or trademarks,
for each open source project belongs to its rightful owner.
If you wish to add or remove any projects, please contact us at [email protected].