A Go template library of competitive programming algorithms and data structures, with solutions to Codeforces and LeetCode problems.
AkashSingh3031/The-Complete-FAANG-Preparation
A collection of DSA, competitive programming and CS fundamentals notes and solutions in Jupyter Notebook, aimed at FAANG-style interview prep.
- Stars
- 12,300
- Forks
- 2,633
- Open issues
- 38
- Last commit
- 12 days ago
What is it?
This repository collects practice material for software engineering interviews. It groups problem sets and solutions for data structures and algorithms, including sheets from Love Babbar's 450 DSA list, the Striver series and an Apna College DSA sheet, with solutions organized by language such as C++, Python and Java.
Beyond algorithms, it covers core computer science subjects that interviewers often ask about: operating systems, DBMS and SQL, computer networks, and object-oriented programming. It also includes sections on competitive programming, aptitude and reasoning questions, programming MCQs and puzzles, plus system design material for low-level and high-level design.
The content is organized as folders in a Jupyter Notebook-heavy repository, so it works as a structured study path rather than a software library. It is released under the MIT license.
Key features
- 01Problem sets from 450 DSA by Love Babbar, Striver series and Apna College DSA sheet.
- 02Core CS topics including operating systems, DBMS, SQL and computer networks.
- 03Solutions organized across C++, Python and Java.
- 04Sections on competitive programming, aptitude, reasoning and puzzles.
- 05System design material covering low-level and high-level design.
Use cases
- Preparing for software engineering interviews at large tech companies.
- Working through a structured DSA practice list in a chosen language.
- Reviewing operating systems, DBMS or networking topics before a technical screen.
- Finding worked solutions to common algorithm problems for self-study.
Things to know
- This is a collection of study notes and solutions rather than installable software.
In collections
Topics
FAQ
- What is The-Complete-FAANG-Preparation?
- A collection of DSA, competitive programming and CS fundamentals notes and solutions in Jupyter Notebook, aimed at FAANG-style interview prep. This repository collects practice material for software engineering interviews. It groups problem sets and solutions for data structures and algorithms, including sheets from Love Babbar's 450 DSA list, the Striver series and an Apna College DSA sheet, with solutions organized by language such as C++, Python and Java.
- Is The-Complete-FAANG-Preparation free to use? What license does it have?
- The-Complete-FAANG-Preparation is open source under the MIT license. Check the license terms before using it in commercial products.
- Is The-Complete-FAANG-Preparation still maintained?
- Actively maintained. The last commit to The-Complete-FAANG-Preparation was on Oct 12, 2026.
- What can I use The-Complete-FAANG-Preparation for?
- Preparing for software engineering interviews at large tech companies. Working through a structured DSA practice list in a chosen language. Reviewing operating systems, DBMS or networking topics before a technical screen. Finding worked solutions to common algorithm problems for self-study.
- Where can I get The-Complete-FAANG-Preparation?
- The source code and installation instructions are on GitHub: https://github.com/AkashSingh3031/The-Complete-FAANG-Preparation
Summary generated by AI from the project's README. GitHub stats refresh daily.
Related projects
Go solutions to LeetCode problems with a companion Cookbook e-book, covering data structures and algorithms for interview prep.
A study guide that groups LeetCode interview questions by reusable solving patterns, with a web app to browse and track them.
A Chinese-language LeetCode study guide with a curated problem order, illustrated solutions, video explanations, and code in C++, Java, Python, Go and JavaScript.
A free, open, continuously updated wiki that teaches competitive programming (OI and ICPC) from basic algorithms to advanced topics.
A volunteer-run, ad-free collection of articles on algorithms and data structures popular in competitive programming, translated and extended from e-maxx.ru.