Skip to content

Hafiz-Sakib/FAANG

Repository files navigation

Heaven for FAANG Lovers

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

Thanks to the Author : Neeraj