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

يعمل هذا المستودع كمورد شامل للبرمجة التنافسية والتحضير للمقابلات التقنية. يوفر مجموعة منظمة من تنفيذات الكود المصدري لهياكل البيانات الأساسية ومشاكل الخوارزميات الكلاسيكية، المصممة لمساعدة المطورين على إتقان مفاهيم علوم الحاسوب الأساسية واستراتيجيات البرمجة الفعالة. بعيداً عن حل المشكلات القياسي، يتميز المشروع بدمج أنماط تصميم البرمجيات في تنفيذاته الخوارزمية. يوضح كيفية تطبيق الأنماط الهيكلية والسلوكية—مثل المزخرفات، والمراقبين، والسينغلتون—للحفاظ على كود نظيف وقابل للتوسيع. بالإضافة إلى ذلك، يغطي المستودع أنماط البرمجة المتزامنة، ويقدم أمثلة على إدارة تجمع الخيوط وتقنيات المزامنة للتعامل مع المهام كثيفة الموارد. تتضمن المجموعة مجموعة واسعة من المواد التعليمية، من تحليل التعقيد وقوالب حل المشكلات إلى تنفيذات محددة لاجتياز الرسوم البيانية، والبرمجة الديناميكية، واستعلامات النطاق. تم تنظيم هذه الموارد للمساعدة في كل من تعلم التقنيات الأساسية والممارسة للتقييمات التقنية المهنية.