Awesome GitHub RepositoriesPartition Problem Solving

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

CloudEvents is an open specification for describing event data in a common format across cloud platforms and services. It defines a standard structure and set of metadata attributes for events, enabling interoperability across different systems so producers and consumers can exchange events without custom translation. The specification provides a protocol-agnostic serialization framework that maps CloudEvents attributes and payloads to multiple serialization formats including JSON, Avro, and Protobuf, and defines transport bindings for mapping events onto protocols like HTTP, AMQP, Kafka, MQTT

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

MoreLINQ is a functional programming toolkit and extension library for .NET that augments LINQ to Objects with advanced operators for sequence manipulation and analysis. It provides a set of tools for declarative data transformation, leveraging lazy evaluation and composition to handle complex object sequences. The library is distinguished by its specialized capabilities for combinatorial generation, including the production of permutations, subsets, and Cartesian products. It also provides advanced sequence joining options, such as full, left, and right outer joins, and supports complex data

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

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.