{"id":15031993,"url":"https://github.com/neerazz/faang","last_synced_at":"2025-05-15T10:02:58.998Z","repository":{"id":37360754,"uuid":"193811440","full_name":"neerazz/FAANG","owner":"neerazz","description":"Competitive programming questions.","archived":false,"fork":false,"pushed_at":"2024-04-13T17:48:36.000Z","size":257674,"stargazers_count":1843,"open_issues_count":3,"forks_count":487,"subscribers_count":42,"default_branch":"master","last_synced_at":"2025-05-15T10:02:49.391Z","etag":null,"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"],"latest_commit_sha":null,"homepage":"https://neerazz.github.io/","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/neerazz.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":"SECURITY.md","support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-06-26T01:59:00.000Z","updated_at":"2025-05-01T18:03:33.000Z","dependencies_parsed_at":"2023-01-21T04:19:29.429Z","dependency_job_id":"3c9c2d97-5b37-4e08-a583-9573b36c8468","html_url":"https://github.com/neerazz/FAANG","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/neerazz%2FFAANG","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/neerazz%2FFAANG/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/neerazz%2FFAANG/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/neerazz%2FFAANG/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/neerazz","download_url":"https://codeload.github.com/neerazz/FAANG/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254319716,"owners_count":22051072,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["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"],"created_at":"2024-09-24T20:17:04.646Z","updated_at":"2025-05-15T10:02:51.963Z","avatar_url":"https://github.com/neerazz.png","language":"Java","readme":"\u003cp align=\"center\"\u003e \n\u003cimg height=\"100\" src=\"https://www.pcr-online.biz/wp-content/uploads/faang-own-logo-660x330.jpg\"\u003e\n\u003c/p\u003e\n\n# Competitive Programming\n\nThe repository contains solutions to various coding Competitive Programming sites like [Leetcode](https://leetcode.com/neerazz90/), [Hackerrank](https://www.hackerrank.com/b_neerajkumarsi1)\n, [Hackearth](https://www.hackerearth.com/@neerajkumarsingh), [Pramp](https://www.pramp.com/dashboard#/), AlgoExpert\n\u0026 [EPI](https://github.com/neerazz/FAANG/blob/master/Resources/Elements%20of%20Programming%20Interviews%20in%20Java.pdf)\n. I've tried to provide the detailed solution and the intuition through comments.\n\nThese questions are classical problems that are most frequently asked by the tech giants in technical interviews and are\nnot related to hard core competitive coding.\n`All the code provided inside the repository is purely original.`\n\n## [Complexities](https://www.bigocheatsheet.com/)\n\n| Type      | Notation | Time Complexities Resources                                                                          | Space Complexities Resources |\n|-----------|:--------:|------------------------------------------------------------------------------------------------------|------------------------------|\n| Constant  |   O(1)   | https://www.interviewcake.com/article/python/big-o-notation-time-and-space-complexity                |                              |\n| Linear    |   O(n)   | https://www.interviewcake.com/article/python/big-o-notation-time-and-space-complexity                |                              |\n| Logarithm | O(Log n) | https://www.interviewcake.com/article/python/logarithms? https://www.youtube.com/watch?v=M4ubFru2O80 |                              |\n| Quadratic |  O(n*n)  | https://www.interviewcake.com/article/python/big-o-notation-time-and-space-complexity                |                              |\n\n# [Resources and training material](https://github.com/neerazz/DS-Algo-SD-Resources)\n- DataStructures \u0026 Algorithm\n  - [Elements of Programming Interviews in Java (Beginner \u0026 Intermediate)](https://github.com/neerazz/DS-Algo-SD-Resources/blob/master/Elements%20of%20Programming%20Interviews%20in%20Java.pdf)\n  - [Grokking the Coding Interview (Beginner \u0026 Intermediate)](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Grokking%20the%20Coding%20Interview%20-%20Patterns%20for%20Coding%20Questions)\n  - [Cracking the Coding Interview (Beginner \u0026 Intermediate)](https://github.com/neerazz/DS-Algo-SD-Resources/blob/master/Cracking%20the%20Coding%20Interview%2C%206th%20Edition%20189%20Programming%20Questions%20and%20Solutions.pdf)\n  - [Coursera](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Coursera)\n    - [Data Structures (Intermediate)](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Coursera/Data%20Structures)\n    - [AlgorithmicToolbox (Advanced)](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Coursera/AlgorithmicToolbox)\n- Object Oriented Design\n  - [Grokking the Object-Oriented Design Interview (Beginner \u0026 Intermediate)](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Grokking%20the%20Object%20Oriented%20Design%20Interview)\n- System Design \n  - [System Design Interview An Insider’s Guide by Alex Yu (Intermediate \u0026 Advanced)](https://github.com/neerazz/DS-Algo-SD-Resources/blob/master/System%20Design%20Interview%20An%20Insider%E2%80%99s%20Guide%20by%20Alex%20Yu.pdf)\n  - [Designing Data Intensive Applications (Intermediate \u0026 Advanced)](https://github.com/neerazz/DS-Algo-SD-Resources/blob/master/Designing%20Data%20Intensive%20Applications.pdf)\n  - [Scalability System Design for Developers](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Scalability%20System%20Design%20for%20Developers)\n- Others\n  - [Typing](https://github.com/neerazz/DS-Algo-SD-Resources/blob/master/typing-finger-chart.png)\n  - [GCP Fundamentals Core-Infrastructure](https://github.com/neerazz/DS-Algo-SD-Resources/tree/master/Coursera-Google-Cloud-Platform-Fundamentals-Core-Infrastructure-master)\n\n## [DataStructures \u0026 Algorithm Problems](https://github.com/neerazz/FAANG/tree/master/Algorithms)\n\n\u003e #### [Top Questions by Problem category](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#datastructures--algorithm-problems)\n\u003e   - [Array, Linked List, Stack, Heap, Tree, Queue](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#datastructures--algorithm-problems)\n\u003e   - [Hash Table](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#hash-table)\n\u003e   - [Binary Search](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#binary-search)\n\u003e   - [Recursion](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#recursion)\n\u003e   - [Backtracking](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#backtracking)\n\u003e   - [Divide and Conquer](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#divide-and-conquer)\n\u003e   - [Greedy Algorithm](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#greedy-algorithm)\n\u003e   - [Dynamic Programming](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#dynamic-programming)\n\u003e   - [Graph](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Topic.md#graph)\n\n\u003e  #### [Questions by Companies](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md)\n\u003e   - [Google](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md#google)\n\u003e   - [Amazon](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md#amazon)\n\u003e   - [Facebook](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md#facebook)\n\u003e   - [LinkedIn](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md#linkedin)\n\u003e   - [Microsoft](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md#microsoft)\n\u003e   - [Uber](https://github.com/neerazz/FAANG/blob/master/Top_LeetCode_Questions_By_Company.md#uber)\n\n## [Contests](https://github.com/neerazz/FAANG/tree/master/Algorithms/Neeraj/contest)\n\n\u003e - [Hackerrank](https://github.com/neerazz/CodingContests/tree/main/hackerrank)\n\u003e - [Leetcode](https://github.com/neerazz/CodingContests/tree/main/leetcode)\n\u003e   - `Includes both Biweekly and Weekly contest.`\n\u003e - [Google Kickstart](https://github.com/neerazz/CodingContests/tree/main/goolgeKickstart)\n\u003e   - [2020](https://github.com/neerazz/CodingContests/tree/main/goolgeKickstart/y2020)\n\u003e   - [2021](https://github.com/neerazz/CodingContests/tree/main/goolgeKickstart/y2021)\n\u003e - [CodeForces](https://github.com/neerazz/CodingContests/tree/main/codeforces)\n\n## [System Design](https://github.com/neerazz/faang-system-design#tips-for-system-design)\n\n\u003e [Tips for System Design](https://github.com/neerazz/faang-system-design/blob/master/Tips_for_system_design.md)\n\n\u003e #### General Design Questions:\n\u003e   - [Tiny URL](https://github.com/neerazz/faang-system-design/tree/master/Neeraj/systemsdesign/tiny-url)\n\u003e   - [Cab Booking Service](https://github.com/neerazz/faang-system-design/tree/master/Neeraj/systemsdesign/cab-booking-system)\n\u003e   - [Amazon](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Amazon%20System%20Design.png)\n\u003e   - [Zoom](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Zoom%20System%20Design.png)\n\u003e   - [Google Map](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Google%20Maps%20Design.png)\n\u003e   - [Facebook](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Facebook%20System%20Design.png)\n\u003e   - [Hotel Booking](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Hoel%20Booking%20System.png)\n\u003e   - [Uber](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Uber%20System%20Design.png)\n\u003e   - [Whatsapp](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Whatsapp%20System%20design.png)\n\u003e   - [Netflix](https://github.com/neerazz/faang-system-design/blob/master/Resources/architecture-diagrams/Video%20Streaming%20Platform.png)\n\u003e\n\n## OOPS Design:\n\n\u003e - [Design Library Management System](https://github.com/neerazz/faang-system-design/tree/master/Neeraj/oops/designs/libraryManagment)\n\u003e - [Design Parking Lot](https://github.com/neerazz/faang-system-design/blob/master/Neeraj/oops/designs/parkinglot)\n\u003e - [Design Call Center](https://github.com/neerazz/faang-system-design/blob/master/Neeraj/oops/designs/callCenter/CallCenter.java)\n\u003e - [Design Hit Counter](https://github.com/neerazz/faang-system-design/blob/master/Neeraj/oops/designs/DesignHitCounter.java)\n\u003e - [Design Linux Find Command](https://github.com/neerazz/faang-system-design/blob/master/Neeraj/oops/designs/LinuxFindFilter.java)\n\u003e - [Design ATM](https://github.com/neerazz/faang-system-design/tree/master/Neeraj/oops/designs/atm)\n\u003e - [Design Movie Ticket System](https://github.com/neerazz/faang-system-design/tree/master/Neeraj/oops/designs/movieTicketSystem)\n\u003e - [Design Pharmacy Shop](https://github.com/neerazz/faang-system-design/tree/master/Neeraj/oops/designs/pharmacyshop)\n\u003e\n\u003e\u003e TODO\n\u003e\u003e - [Design Vending Machine](https://leetcode.com/discuss/interview-question/982302/FANNG-question-OOP-please-post-your-solutions-to-this)\n\n## [Important Links](https://github.com/neerazz/FAANG/blob/master/ImportantLinks.md#hacking-software-engineering-interviews)\n\n## How to contribute?\n\n1. Fork the repository\n2. Do the desired changes (add/delete/modify)\n3. Make a pull request\n\n## When to contribute?\n\n1. If there is no solution to a problem.\n2. If your solution is asymptotically faster than the one in the main branch.\n3. If your algorithm is of the same time complexity but with reduced code size it would be better to, comment out the\n   original solution and make a pull request with your solution.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fneerazz%2Ffaang","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fneerazz%2Ffaang","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fneerazz%2Ffaang/lists"}