Skip to content

neerazz/FAANG

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Competitive Programming

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 intuition 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.

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

Tips for System Design

General Design Questions:

OOPS Design:

TODO

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.
  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 it would be better to, comment out the original solution and make a pull request with your solution.