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

Este proyecto es un repositorio curado de desafíos de programación de LeetCode resueltos y explicaciones para entrevistas técnicas. Sirve como guía de estudio de algoritmos y recurso de programación competitiva, proporcionando implementaciones prácticas de código y lógica paso a paso para resolver problemas estándar de ciencias de la computación. La colección presenta estudios de soluciones bilingües con explicaciones técnicas detalladas escritas tanto en inglés como en chino. Estas soluciones están organizadas por dificultad y dominio técnico, accesibles tanto a través de un navegador web como de una interfaz de aplicación móvil. El sistema utiliza almacenamiento de contenido basado en markdown y generación de sitios estáticos para renderizar las guías técnicas. Incluye filtrado basado en metadatos para organizar los desafíos por categorías, como bases de datos, shell o concurrencia.

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 is a comprehensive backend engineering knowledge base and interview preparation resource. It provides a structured collection of technical interview questions, theoretical answers, and solved algorithmic problems. The project distinguishes itself by combining high-level architectural analysis with low-level language internals. It features detailed study materials on the Go runtime, including the scheduler, garbage collection, and memory management, alongside deep dives into distributed systems patterns such as high-availability strategies, distributed tracing, and cache consisten

Este proyecto es una colección de referencias técnicas condensadas y guías de estudio para el lenguaje C++. Sirve como una hoja de trucos (cheat sheet) del lenguaje y referencia de programación que cubre la sintaxis central, estándares y patrones de organización de datos. El recurso proporciona guías especializadas para el estudio de algoritmos, referencia de estructuras de datos y preparación de entrevistas técnicas. Incluye materiales para revisar la complejidad computacional y el uso eficiente de estructuras de datos para la programación competitiva. El contenido cubre amplias áreas de capacidad, incluyendo programación orientada a objetos, gestión de memoria y programación genérica. También detalla contenedores de la biblioteca estándar, implementaciones de algoritmos de búsqueda y varias estructuras de árboles.

Este proyecto es una librería de algoritmos de ordenamiento en JavaScript y un recurso de programación educativa. Proporciona una colección de implementaciones de ordenamiento clásicas diseñadas para enseñar la lógica detrás de las técnicas comunes de ordenamiento de datos. El proyecto sirve como guía de referencia técnica, ofreciendo implementaciones de varios métodos de ordenamiento junto con explicaciones de su complejidad temporal y espacial. Se centra en la aplicación de patrones fundamentales de ciencias de la computación dentro de un entorno JavaScript. La librería cubre una amplia gama de algoritmos de ordenamiento, incluyendo métodos basados en comparación como quicksort, merge sort y heapsort, así como técnicas basadas en distribución como radix sort y bucket sort. También incluye implementaciones iterativas básicas como bubble sort e insertion sort.

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

Este proyecto es una guía de referencia completa para fundamentos de ciencias de la computación, proporcionando resúmenes estructurados de estructuras de datos esenciales y principios algorítmicos. Sirve como un recurso técnico para que los desarrolladores repasen conceptos básicos de programación, layouts de memoria y características operativas requeridas para el desarrollo de software y evaluaciones técnicas. La colección se distingue por ofrecer documentación concisa y enfocada en la implementación para una amplia gama de técnicas estándar. Cubre la mecánica de varios algoritmos de ordenamiento y búsqueda, estrategias de recorrido de grafos y árboles, y la gestión de estructuras de datos fundamentales como tablas hash, listas enlazadas y heaps. Cada entrada incluye un análisis de complejidad computacional para ayudar a los desarrolladores a evaluar el rendimiento y la escalabilidad de diferentes enfoques. El repositorio organiza esta información en archivos markdown estáticos, facilitando la navegación rápida y la revisión de temas técnicos. Abarca una amplia superficie de conocimiento, desde patrones de diseño recursivos básicos y paradigmas algorítmicos hasta la lógica operativa específica requerida para mantener y manipular jerarquías de datos complejas.