Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/neerazz/FAANG

Competitive programming questions.
https://github.com/neerazz/FAANG

algorithm algorithms algorithms-and-data-structures amazon apple coding-interviews competitive-programming data-structures faang facebook hackerrank interview-practice interview-preparation job-preparation leetcode leetcode-solutions maang netflix system-design

Last synced: about 2 months ago
JSON representation

Competitive programming questions.

Host: GitHub
URL: https://github.com/neerazz/FAANG
Owner: neerazz
Created: 2019-06-26T01:59:00.000Z (over 5 years ago)
Default Branch: master
Last Pushed: 2024-04-13T17:48:36.000Z (8 months ago)
Last Synced: 2024-11-05T02:51:35.723Z (about 2 months ago)
Topics: algorithm, algorithms, algorithms-and-data-structures, amazon, apple, coding-interviews, competitive-programming, data-structures, faang, facebook, hackerrank, interview-practice, interview-preparation, job-preparation, leetcode, leetcode-solutions, maang, netflix, system-design
Language: Java
Homepage: https://neerazz.github.io/
Size: 246 MB
Stars: 1,813
Watchers: 42
Forks: 483
Open Issues: 4
Metadata Files:
- Readme: README.md
- Security: SECURITY.md

Awesome Lists containing this project

README

        
 





# Competitive Programming

The repository contains solutions to various coding Competitive Programming sites like [Leetcode](https://leetcode.com/neerazz90/), [Hackerrank](https://www.hackerrank.com/b_neerajkumarsi1)

, [Hackearth](https://www.hackerearth.com/@neerajkumarsingh), [Pramp](https://www.pramp.com/dashboard#/), AlgoExpert

& [EPI](https://github.com/neerazz/FAANG/blob/master/Resources/Elements%20of%20Programming%20Interviews%20in%20Java.pdf)

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

## [Complexities](https://www.bigocheatsheet.com/)

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

# [Resources and training material](https://github.com/neerazz/DS-Algo-SD-Resources)

- DataStructures & Algorithm

  - [Elements of Programming Interviews in Java (Beginner & Intermediate)](https://github.com/neerazz/DS-Algo-SD-Resources/blob/master/Elements%20of%20Programming%20Interviews%20in%20Java.pdf)

  - [Grokking the Coding Interview (Beginner & Intermediate)](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Grokking%20the%20Coding%20Interview%20-%20Patterns%20for%20Coding%20Questions)

  - [Cracking the Coding Interview (Beginner & Intermediate)](https://github.com/neerazz/DS-Algo-SD-Resources/blob/master/Cracking%20the%20Coding%20Interview%2C%206th%20Edition%20189%20Programming%20Questions%20and%20Solutions.pdf)

  - [Coursera](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Coursera)

    - [Data Structures (Intermediate)](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Coursera/Data%20Structures)

    - [AlgorithmicToolbox (Advanced)](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Coursera/AlgorithmicToolbox)

- Object Oriented Design

  - [Grokking the Object-Oriented Design Interview (Beginner & Intermediate)](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Grokking%20the%20Object%20Oriented%20Design%20Interview)

- System Design 

  - [System Design Interview An Insider’s Guide by Alex Yu (Intermediate & Advanced)](https://github.com/neerazz/DS-Algo-SD-Resources/blob/master/System%20Design%20Interview%20An%20Insider%E2%80%99s%20Guide%20by%20Alex%20Yu.pdf)

  - [Designing Data Intensive Applications (Intermediate & Advanced)](https://github.com/neerazz/DS-Algo-SD-Resources/blob/master/Designing%20Data%20Intensive%20Applications.pdf)

  - [Scalability System Design for Developers](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Scalability%20System%20Design%20for%20Developers)

- Others

  - [Typing](https://github.com/neerazz/DS-Algo-SD-Resources/blob/master/typing-finger-chart.png)

  - [GCP Fundamentals Core-Infrastructure](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Coursera-Google-Cloud-Platform-Fundamentals-Core-Infrastructure-master)

## [DataStructures & Algorithm Problems](https://github.com/neerazz/FAANG/tree/master/Algorithms)

> #### [Top Questions by Problem category](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#datastructures--algorithm-problems)

>   - [Array, Linked List, Stack, Heap, Tree, Queue](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#datastructures--algorithm-problems)

>   - [Hash Table](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#hash-table)

>   - [Binary Search](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#binary-search)

>   - [Recursion](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#recursion)

>   - [Backtracking](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#backtracking)

>   - [Divide and Conquer](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#divide-and-conquer)

>   - [Greedy Algorithm](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#greedy-algorithm)

>   - [Dynamic Programming](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#dynamic-programming)

>   - [Graph](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#graph)

>  #### [Questions by Companies](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md)

>   - [Google](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md#google)

>   - [Amazon](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md#amazon)

>   - [Facebook](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md#facebook)

>   - [LinkedIn](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md#linkedin)

>   - [Microsoft](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md#microsoft)

>   - [Uber](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md#uber)

## [Contests](https://github.com/neerazz/FAANG/tree/master/Algorithms/Neeraj/contest)

> - [Hackerrank](https://github.com/neerazz/CodingContests/tree/main/hackerrank)

> - [Leetcode](https://github.com/neerazz/CodingContests/tree/main/leetcode)

>   - `Includes both Biweekly and Weekly contest.`

> - [Google Kickstart](https://github.com/neerazz/CodingContests/tree/main/goolgeKickstart)

>   - [2020](https://github.com/neerazz/CodingContests/tree/main/goolgeKickstart/y2020)

>   - [2021](https://github.com/neerazz/CodingContests/tree/main/goolgeKickstart/y2021)

> - [CodeForces](https://github.com/neerazz/CodingContests/tree/main/codeforces)

## [System Design](https://github.com/neerazz/faang-system-design#tips-for-system-design)

> [Tips for System Design](https://github.com/neerazz/faang-system-design/blob/master/Tips_for_system_design.md)

> #### General Design Questions:

>   - [Tiny URL](https://github.com/neerazz/faang-system-design/tree/master/Neeraj/systemsdesign/tiny-url)

>   - [Cab Booking Service](https://github.com/neerazz/faang-system-design/tree/master/Neeraj/systemsdesign/cab-booking-system)

>   - [Amazon](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Amazon%20System%20Design.png)

>   - [Zoom](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Zoom%20System%20Design.png)

>   - [Google Map](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Google%20Maps%20Design.png)

>   - [Facebook](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Facebook%20System%20Design.png)

>   - [Hotel Booking](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Hoel%20Booking%20System.png)

>   - [Uber](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Uber%20System%20Design.png)

>   - [Whatsapp](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Whatsapp%20System%20design.png)

>   - [Netflix](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Video%20Streaming%20Platform.png)

>

## OOPS Design:

> - [Design Library Management System](https://github.com/neerazz/faang-system-design/tree/master/Neeraj/oops/designs/libraryManagment)

> - [Design Parking Lot](https://github.com/neerazz/faang-system-design/blob/master/Neeraj/oops/designs/parkinglot)

> - [Design Call Center](https://github.com/neerazz/faang-system-design/blob/master/Neeraj/oops/designs/callCenter/CallCenter.java)

> - [Design Hit Counter](https://github.com/neerazz/faang-system-design/blob/master/Neeraj/oops/designs/DesignHitCounter.java)

> - [Design Linux Find Command](https://github.com/neerazz/faang-system-design/blob/master/Neeraj/oops/designs/LinuxFindFilter.java)

> - [Design ATM](https://github.com/neerazz/faang-system-design/tree/master/Neeraj/oops/designs/atm)

> - [Design Movie Ticket System](https://github.com/neerazz/faang-system-design/tree/master/Neeraj/oops/designs/movieTicketSystem)

> - [Design Pharmacy Shop](https://github.com/neerazz/faang-system-design/tree/master/Neeraj/oops/designs/pharmacyshop)

>

>> TODO

>> - [Design Vending Machine](https://leetcode.com/discuss/interview-question/982302/FANNG-question-OOP-please-post-your-solutions-to-this)

## [Important Links](https://github.com/neerazz/FAANG/blob/master/ImportantLinks.md#hacking-software-engineering-interviews)

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