Awesome GitHub RepositoriesAlgorithm Study Guides

This project is a community-driven academic resource repository designed to centralize historical exam papers, lecture notes, and study materials for university-level coursework. It functions as an open educational resource, providing a collaborative archive where students can share and organize documentation to assist in preparing for academic assessments across a wide range of disciplines. The platform distinguishes itself through a crowdsourced aggregation model that relies on peer contributions and manual verification to maintain the accuracy of its library. All materials are stored as fl

This project is a comprehensive technical knowledge base and study guide focused on data structures, algorithms, and computer science fundamentals. It provides a curated collection of tutorials and educational resources designed to support technical growth and academic learning. The repository distinguishes itself through a heavy emphasis on visual learning, utilizing mind maps, diagrams, and illustrated breakdowns to explain complex algorithmic logic. It further supports career readiness by providing a repository of company-specific interview questions and real-world candidate experiences.

This project is a comprehensive educational repository providing study guides, a competitive programming curriculum, and technical interview resources. It serves as a reference for learning fundamental programming methods, algorithmic logic, and data structure implementations. The repository features multi-language implementation references that allow for the comparison of algorithmic solutions across different programming languages. This approach enables the analysis of performance and implementation details through cross-language code comparisons. The educational content covers computer sc

This project is an algorithm study resource, a centralized LeetCode solution repository, and a technical interview study guide. It provides Chinese translations of textbooks and guides on data structures and algorithms for academic study and professional preparation. The project distinguishes itself by delivering multi-language solution repositories and translated academic materials through a static site generation model. This architecture enables compile-time content translation and offline-first delivery of educational assets as static files. The repository covers a wide range of algorithm

algorithm-base is an educational library and study guide designed for simulating algorithms and studying data structures. It functions as an execution visualizer that renders step-by-step state changes and pointer updates through animated simulations to illustrate how data movement works. The project distinguishes itself by mapping conceptual logic directly to multi-language source code implementations. It utilizes a comparative analysis framework to evaluate different algorithmic strategies based on stability, time complexity, and space complexity, while organizing problems by underlying mec

leetcode_101 is a curated library of algorithmic problem sets and a repository of solved LeetCode challenges. It serves as a technical interview guide by providing code implementations for common software engineering interview questions. The project supports a technical interview preparation workflow, focusing on LeetCode problem solving and the study of standardized code solutions for data structures and algorithms. It is designed to facilitate coding skill development and the study of technical interview problems. The repository utilizes markdown-based content authoring and a static-file d

CLRS is an algorithm implementation library and reference providing code solutions for the classic computer science problems and theoretical concepts found in Introduction to Algorithms. It serves as a computer science study guide and a set of textbook exercise solutions used for academic study and the verification of time and space complexity. The project is a multi-language algorithm library, implementing theoretical algorithms across several programming languages to demonstrate cross-language application and behavior. This approach allows for the study of different memory management and sy

This project is a comprehensive knowledge base and study resource designed for mastering technical interviews. It provides structured guides, roadmaps, and curricula focused on data structures, algorithms, system design, and frontend engineering to help candidates prepare for software engineering screenings. The repository distinguishes itself by offering a holistic approach to professional advancement. Beyond technical drills, it includes a career development handbook covering resume optimization, salary benchmarking, and strategic negotiation coaching. It also provides detailed methodologie

itsy-bitsy-data-structures is a collection of fundamental computer science data structures implemented in JavaScript. It serves as an educational resource and algorithm study guide, providing simplified code implementations of classic data organization patterns to demonstrate internal logic and usage. The project provides clear and concise JavaScript implementations of stacks, queues, and linked lists. These examples are designed for learning, technical interview preparation, and studying the mechanical behavior of core data structures through code. The implementations utilize various comput

algs4 is a Java data structures library and algorithm reference collection designed as the source code for a standard computer science textbook curriculum. It provides a comprehensive suite of fundamental implementations for sorting, searching, and core data organization. The project serves as a graph theory framework, offering tools for representing directed and undirected graphs and performing complex traversals and pathfinding. It also includes a broad sorting algorithm suite and a specialized library of Java data structures, including stacks, queues, priority queues, and symbol tables. I

LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro

This project is a curated library of technical ebooks and guides focused on Java language learning, backend architecture, and Java Virtual Machine internals. It serves as a reference-driven knowledge base and a technical repository for software engineering principles. The collection provides specialized materials for studying Java backend architecture, including high-performance server-side development and concurrency. It includes a dedicated JVM technical reference for performance tuning and internal machine behavior, as well as resources for algorithm study and data structures. Additional

Dieses Projekt ist ein kuratiertes Repository mit gelösten LeetCode-Programmieraufgaben und Erklärungen für technische Interviews. Es dient als Algorithmen-Lernhilfe und Ressource für Competitive Programming und bietet praktische Code-Implementierungen sowie Schritt-für-Schritt-Logik zur Lösung klassischer Informatikprobleme. Die Sammlung bietet zweisprachige Lösungsstudien mit detaillierten technischen Erklärungen auf Englisch und Chinesisch. Diese kuratierten Coding-Lösungen sind nach Schwierigkeitsgrad und technischem Bereich organisiert und über Webbrowser sowie eine mobile App abrufbar. Das System nutzt Markdown-basierte Inhaltsspeicherung und Static Site Generation zum Rendern der technischen Anleitungen. Es enthält Metadaten-gestützte Filter, um Aufgaben nach Kategorien wie Datenbanken, Shell oder Concurrency zu ordnen.

Algodeck is an open-source collection of flash cards designed for reviewing algorithms, data structures, and system design concepts, specifically curated for technical interview preparation. The project organizes knowledge into atomic question-and-answer pairs and incorporates spaced repetition scheduling to optimize long-term memory retention. The flash card catalog covers a broad range of computer science topics, including classic sorting algorithms like quicksort and mergesort, data structure operations for arrays, trees, heaps, tries, and graphs, as well as bit manipulation techniques for

interview-go ist eine umfassende Wissensdatenbank für Backend-Engineering und eine Ressource zur Vorbereitung auf Vorstellungsgespräche. Sie bietet eine strukturierte Sammlung technischer Interviewfragen, theoretischer Antworten und gelöster algorithmischer Probleme. Das Projekt zeichnet sich durch die Kombination von architektonischer Analyse auf hoher Ebene mit Low-Level-Sprachinterna aus. Es bietet detaillierte Lernmaterialien zur Go-Runtime, einschließlich Scheduler, Garbage Collection und Speicherverwaltung, sowie tiefe Einblicke in Patterns für verteilte Systeme wie Hochverfügbarkeitsstrategien, Distributed Tracing und Cache-Konsistenz. Die Ressource deckt ein breites Spektrum an Informatik-Grundlagen ab, einschließlich Datenbank-Indizierung und Persistenzmodellen, Grundlagen von Suchmaschinen und Grundlagen großer Sprachmodelle (LLMs). Sie kombiniert diese theoretischen Konzepte mit praktischen Coding-Übungen und Referenzimplementierungen für gängige Sortier-, String-Manipulations- und Sliding-Window-Algorithmen.

This project is a collection of condensed technical references and study guides for the C++ language. It serves as a language cheat sheet and programming reference covering core syntax, standards, and data organization patterns. The resource provides specialized guides for algorithm study, data structure reference, and technical interview preparation. It includes materials for reviewing computational complexity and efficient data structure usage for competitive programming. The content covers broad capability areas including object-oriented programming, memory management, and generic program

Dieses Projekt ist eine JavaScript-Bibliothek für Sortieralgorithmen und eine pädagogische Programmierressource. Sie bietet eine Sammlung klassischer Sortierimplementierungen, die dazu dienen, die Logik hinter gängigen Techniken zur Datenordnung zu vermitteln. Das Projekt dient als technisches Referenzhandbuch und bietet Implementierungen verschiedener Sortiermethoden zusammen mit Erklärungen zu deren Zeit- und Platzkomplexität. Es konzentriert sich auf die Anwendung grundlegender Informatikmuster innerhalb einer JavaScript-Umgebung. Die Bibliothek deckt eine breite Palette an Sortieralgorithmen ab, einschließlich vergleichsbasierter Methoden wie Quicksort, Mergesort und Heapsort sowie verteilungsbasierter Techniken wie Radixsort und Bucketsort. Sie enthält zudem grundlegende iterative Implementierungen wie Bubblesort und Insertionsort.

This project is a curated educational resource and technical interview preparation kit. It provides a comprehensive collection of study guides and question banks focused on front-end web development, JavaScript algorithms, and professional coding assessments. The repository includes a technical interview question bank and specialized study sets for JavaScript algorithms. These resources cover conceptual explanations and programming challenges designed to help developers master common coding patterns and theoretical questions. The content covers core web development fundamentals, including HT

This project is a comprehensive reference guide for computer science fundamentals, providing structured summaries of essential data structures and algorithmic principles. It serves as a technical resource for developers to review core programming concepts, memory layouts, and operational characteristics required for software development and technical assessments. The collection distinguishes itself by offering concise, implementation-focused documentation for a wide range of standard techniques. It covers the mechanics of various sorting and searching algorithms, graph and tree traversal stra