Awesome GitHub RepositoriesSubarray Sum Algorithms

30-seconds-of-code is a comprehensive knowledge base and programming snippet library designed to support software engineering education and professional development. It provides a curated collection of reusable code units and technical guides that help developers master core language mechanics, design patterns, and architectural philosophies. The project distinguishes itself by offering a wide-ranging library of algorithmic solutions and web development patterns that are organized into modular, independently testable units. It emphasizes functional programming paradigms and declarative logic,

This project is a curated educational resource and solution repository for algorithmic challenges, specifically focused on LeetCode problems. It serves as a technical reference for common data structures and algorithmic patterns, providing verified code implementations across multiple programming languages alongside detailed logic and complexity analysis. The repository functions as a comprehensive study guide for competitive programming and technical interview preparation. It includes specialized learning tools such as an Anki flashcard dataset for spaced repetition and a browser extension t

This project is a comprehensive library of reference implementations for fundamental data structures and algorithms, designed to support technical interview preparation and software engineering assessments. It provides a structured collection of computational techniques for solving complex problems involving arrays, strings, graphs, trees, and mathematical analysis. The library distinguishes itself by offering specialized implementations for advanced topics, including concurrent programming patterns and geometric algorithms. It features thread-safe primitives for managing shared state and tas

This project is a reference library of Java implementations for algorithmic coding challenges and data structure patterns. It serves as a study guide for technical interview preparation, providing a curated collection of LeetCode solutions organized by difficulty and algorithmic technique. The collection includes a mapping system that associates specific algorithm problems with the companies that frequently use them in technical interviews. The repository covers a wide range of capability areas, including tree algorithms for hierarchy construction and verification, string processing for sequ

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

Este proyecto es una colección integral de librerías y toolkits de C++ que proporcionan implementaciones de referencia para estructuras de datos, algoritmos de grafos y lógica de bits. Sirve como una referencia de algoritmos en C++ que contiene más de 180 problemas de programación resueltos y un toolkit especializado para programación competitiva. El repositorio se distingue por sus extensas librerías de manipulación de bits de bajo nivel para comprobaciones de paridad, detección de endianness y lógica basada en XOR. También proporciona una amplia gama de soluciones de referencia para desafíos algorítmicos complejos que involucran backtracking, teoría de grafos y programación dinámica. La superficie de capacidades cubre organizadores de datos lineales y jerárquicos fundamentales, incluyendo listas enlazadas, pilas, colas y árboles de búsqueda binaria. Incluye un conjunto completo de algoritmos de grafos para búsqueda de caminos y árboles de expansión, varios métodos de ordenamiento y búsqueda, transformaciones de matrices y utilidades de procesamiento de cadenas. Además, cubre funciones computacionales matemáticas, compresión de datos sin pérdida y cifrados criptográficos básicos.

This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides a suite of tools for general algorithm implementation, including data structure management, graph theory analysis, and string processing. The library is distinguished by its specialized toolkits for cryptographic hashing and encoding, featuring implementations of MD5, SHA-1, and Base64. It also includes advanced capabilities for high-performance string processing via suffix trees and arrays, as well as computational number theory for primality testing and arbitrary-precision

LeetCode-Swift is a collection of algorithm solutions written in Swift, designed for coding interview preparation. Each solution is implemented as a self-contained function with no external dependencies, making it easy to run and test. The repository organizes solutions by topic and company, and every file includes time and space complexity annotations, allowing quick evaluation of algorithmic efficiency. What sets this repository apart is its flat file structure and the way solutions are tagged with the companies that asked them in interviews, enabling targeted practice. All code resides in

Este proyecto es una biblioteca de referencia curada de patrones algorítmicos, implementaciones de estructuras de datos y notas de diseño de sistemas. Sirve como un conjunto de problemas algorítmicos en Java y una guía de programación competitiva, proporcionando una colección de soluciones para desafíos de codificación de plataformas como LeetCode y LintCode. La biblioteca se distingue por su conjunto integral de implementaciones en Java para estructuras de datos avanzadas y estrategias algorítmicas. Incluye referencias detalladas para resolver problemas complejos con el análisis de complejidad temporal y espacial correspondiente. El proyecto cubre una amplia superficie de fundamentos de ciencias de la computación, incluyendo diseño de algoritmos, implementación de estructuras de datos y diseño de sistemas. Sus contenidos abarcan teoría de grafos, programación dinámica, búsqueda y optimización, y técnicas de procesamiento de datos lineales. También incluye notas sobre escalabilidad de infraestructura, almacenamiento en caché de rendimiento y patrones de arquitectura de software.

This repository is a curated guide and implementation library of coding patterns used to solve data structures and algorithms problems. It serves as a technical interview study resource, providing a comprehensive set of strategies and computational logic examples for optimizing time and space complexity. The project focuses on standardized algorithmic patterns, including sliding windows, two pointers, and dynamic programming. It features specific implementations for a wide range of challenges, such as LeetCode problem solutions and specialized techniques like cyclic sort and bitwise XOR opera

This project is a Go algorithm implementation library and a reference for data structures. It serves as a collection of solved coding interview problems and an algorithmic pattern collection, providing a reference of over 100 common challenges implemented in Go. The library focuses on specific problem-solving strategies, including sliding windows, two pointers, and dynamic programming. It provides coded examples of standard sorting, searching, and graph traversal techniques to facilitate the study of algorithmic patterns. The repository covers a broad range of capabilities, including array a

This project is a collection of optimized computational routines and standardized implementations of fundamental computer science algorithms. It serves as an educational library for studying and applying core algorithmic patterns, including dynamic programming, greedy strategies, and recursive decomposition, within a TypeScript environment. The library distinguishes itself by providing generalized solvers for complex optimization and analysis tasks. It includes specific implementations for resource allocation, such as rod cutting, interval scheduling, and change-making problems, alongside seq

Este repositorio sirve como un recurso integral para la programación competitiva y la preparación de entrevistas técnicas. Proporciona una colección estructurada de implementaciones de código fuente para estructuras de datos fundamentales y problemas algorítmicos clásicos, diseñados para ayudar a los desarrolladores a dominar conceptos básicos de ciencias de la computación y estrategias de codificación eficientes. Más allá de la resolución de problemas estándar, el proyecto se distingue por integrar patrones de diseño de software en sus implementaciones algorítmicas. Demuestra cómo aplicar patrones estructurales y de comportamiento —como decoradores, observadores y singletons— para mantener un código limpio y extensible. Además, el repositorio cubre patrones de programación concurrente, ofreciendo ejemplos de gestión de grupos de subprocesos y técnicas de sincronización para manejar tareas que consumen muchos recursos. La colección incluye una amplia gama de materiales educativos, desde análisis de complejidad y plantillas de resolución de problemas hasta implementaciones específicas para recorrido de grafos, programación dinámica y consultas de rango. Estos recursos están organizados para ayudar tanto en el aprendizaje de técnicas fundamentales como en la práctica para evaluaciones técnicas profesionales.