Awesome GitHub RepositoriesAlgorithm Libraries

LeetCode-Go is a competitive programming repository and Go algorithm library. It provides a collection of optimized solutions for LeetCode challenges, focusing on time and space complexity. The project serves as a reference for data structures and algorithms implemented in Go. It covers algorithm problem solving and performance optimization to meet strict memory and runtime constraints. The repository includes capabilities for technical interview preparation and the application of Go language idioms to complex computing problems. Each solution is paired with a test suite to verify correctnes

This project is an algorithm implementation reference and educational resource providing a library of common computer science algorithms implemented in Rust. It serves as a codebase for learning data structures and algorithmic logic through practical, executable examples. The collection is designed for computer science education and rust language proficiency, allowing users to study computational patterns and solve programming challenges. It provides a reference for those practicing competitive programming or seeking to understand how to apply Rust idioms to standard algorithmic logic.

EASTL is a C++ Standard Template Library implementation consisting of containers, iterators, and algorithms. It provides cross-platform data structures and a template-based algorithm library designed for use in resource-constrained game engine environments. The library focuses on game engine memory management, providing specialized utilities that ensure predictable memory allocation and high-performance access for real-time applications. These containers maintain consistent behavior across different operating systems and hardware platforms. The project covers high-performance C++ development

Pygorithm es una biblioteca de algoritmos en Python y una referencia de lógica computacional. Proporciona una colección de implementaciones algorítmicas estándar y herramientas para analizar la eficiencia en tiempo de ejecución y el rendimiento de escalado de funciones específicas. El proyecto permite la inspección del código fuente subyacente de funciones internas para estudiar cómo se estructura y ejecuta la lógica. Mapea implementaciones específicas a su complejidad teórica de tiempo y espacio para el análisis de rendimiento. La biblioteca está organizada en módulos discretos que soportan la ejecución de patrones algorítmicos estándar en conjuntos de datos variables. Incluye capacidades para realizar benchmarks de implementaciones en Python y calcular la complejidad asintótica.

cp-notebook is an algorithmic knowledge base and implementation library designed for competitive programming practice. It serves as a system for computational problem solving, allowing for the organization of problem sets, solution templates, and the study of competition mathematics. The project utilizes a taxonomy-based tagging system and schema-driven organization to map computational tasks to a consistent file structure. It employs a language-agnostic template engine and markdown-based rendering to transform raw text and code snippets into a formatted, static knowledge base for fast lookup