Awesome GitHub RepositoriesLinear Collections

This project serves as a centralized knowledge base and study guide for mastering computer science fundamentals and technical interview preparation. It provides a structured collection of algorithmic implementations, data structure guides, and theoretical references designed to support professional development and problem-solving skills. The repository distinguishes itself through a taxonomy-based organization that maps complex concepts into a hierarchical structure. It standardizes the expression of abstract data structures and algorithms using a consistent programming language, with impleme

This project is a computer science educational resource and a library of common data structures and algorithms implemented in Swift. It serves as a practical reference for studying complexity and efficiency through solved algorithmic problems and conceptual guides. The collection includes implementations of linear and hierarchical data structures, such as stacks, queues, linked lists, and trees. It covers a wide range of computational patterns, including graph and pathfinding implementations, mathematical numerical methods, and data compression techniques. The project also provides implement

This project is a comprehensive collection of common computer science algorithms and data structures implemented in Swift. It serves as an educational reference and library for studying computational complexity, algorithmic logic, and data structure engineering through practical code examples. The repository provides a wide suite of data structure implementations, including various types of linked lists, heaps, hash tables, and an extensive range of hierarchical trees such as Red-Black, B-Tree, and Splay trees. It also covers diverse sorting and searching techniques, from basic bubble sort to

This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming. It serves as a centralized repository for algorithmic theory, data structures, and mathematical techniques, providing a structured reference for informatics and collegiate programming competitions. The project distinguishes itself by integrating educational content with a robust suite of automation utilities. It provides a complete workflow for competitive programming, including tools for automated test case generation, solution verification, and direct interaction with onlin

This project is a comprehensive technical interview preparation resource and computer science interview guide. It serves as an educational reference for developers to study core software engineering fundamentals and common coding patterns required for employment screenings. The repository provides detailed guides and references covering data structures and algorithms, networking and security, operating systems, and web development. It specifically focuses on the implementation and complexity analysis of sorting, searching, and graph algorithms. The material encompasses a wide breadth of comp

Garnet is a multi-threaded in-memory database and distributed key-value store. It functions as a high-performance remote cache store that implements the RESP wire protocol to maintain compatibility with existing Redis clients and libraries. The project is distinguished by a shared-memory architecture that enables parallel request processing across multiple cores for sub-millisecond latency. It features a tiered storage system that automatically offloads colder data from system memory to SSD or cloud storage layers, and includes a specialized vector search database for high-dimensional similar

CS-Xmind-Note is a collection of structured mind maps and conceptual diagrams serving as a comprehensive knowledge base for computer science fundamentals. It functions as an academic reference and study guide, organizing core subjects into a visual mapping of interdependent technical concepts. The project utilizes an XMind-compatible schema to model complex domains through hierarchical nodes and relational concept mapping. This approach allows for the visual representation of technical layers, linking hardware specifications to software abstractions. The knowledge base covers several primary

This is a collection of classic computer science algorithms and data structures implemented from scratch in JavaScript. The project provides reference implementations of fundamental concepts including sorting algorithms, binary search, linked lists, and binary search trees, all built as standalone pure functions with no external dependencies. The implementations cover a range of data structures, including singly-linked, doubly-linked, and circular linked lists with full traversal and mutation operations, as well as binary search trees supporting insertion, deletion, and search. Sorting algori

This project is a JavaScript algorithm library and computer science reference. It provides a collection of standard computational logic patterns and data structure implementations, including linked lists, trees, and graphs, for both educational and practical use. The codebase serves as a technical interview study guide, offering a practical resource for practicing common coding challenges and data structure manipulations. It is designed for computer science education, allowing users to study how classic algorithms work by reviewing and running implementations of established logic patterns. T

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

language-ext is a functional programming framework for C# that provides a suite of immutable data structures and monadic types. It enables the implementation of pure functional programming patterns, utilizing containers to manage side effects, optional values, and error handling. The library is distinguished by its advanced concurrency and state management tools, including a software transactional memory system and lock-free atomic references. It also provides specialized utilities for distributed systems, such as vector clocks for causality tracking and deterministic data conflict resolution

该项目是一个 C# 算法库和数据结构集合。它作为计算机科学参考，提供经典排序、搜索和图遍历模式的实用实现。 该库包括一个专门的字符串处理工具包，用于分析文本相似度、计算编辑距离和管理基于前缀的搜索。它还具有用于建模网络关系和计算最短路径的图论实现。 代码库涵盖了广泛的能力，包括线性及分层集合的管理、树数据操作和可视化，以及数学数值序列的计算。

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

Lancet 是 Go 标准库的全面扩展，提供了一系列可复用的函数和数据结构，旨在减少应用中的样板代码。它是一个跨多个领域的通用工具包，包括并发、安全、网络和函数式逻辑。 该项目的特色在于针对 Go 并发的专用工具包（如键控锁和基于通道的流处理），以及支持柯里化和函数组合的专用函数式编程套件。它还包含一个使用 AES、RSA 和 SM 标准实现对称和非对称加密的专用密码学库。 该库涵盖了广泛的功能领域，包括 LRU 缓存和二叉搜索树等高级数据结构、代数和统计数学计算，以及用于进程和文件管理的操作系统集成。它还提供了用于 HTTP 网络、日期和时间操作，以及集合代数和惰性流求值等高级数据处理的实用程序。

uthash 是一个基于宏的 C 语言数据结构库，提供了哈希表、链表、栈和动态数组的仅头文件（header-only）实现。它允许在无需链接外部库的情况下进行基于键的查找和组织化数据存储。 该库使用侵入式链接（intrusive linking）通过宏将元数据直接嵌入到用户定义的结构体中。这种方法实现了原地结构扩展，允许在不为容器节点进行额外内存分配的情况下，将哈希和链接字段添加到现有的结构体中。 该项目还涵盖了专门的内存和数据流管理，包括用于连续数据流的固定大小循环缓冲区，以及具有自动内存分配功能的字符串缓冲区。这些工具极大地简化了资源受限环境和嵌入式系统中的数据处理。

Janet is a Lisp-based dynamic programming language featuring a register-based bytecode virtual machine and an embeddable scripting engine. It functions as a fiber-based concurrency runtime and includes a parsing engine based on Parsing Expression Grammars. The project is distinguished by its ability to be integrated into C or C++ applications via a minimal header interface. It utilizes a Lisp-style macro system for compile-time code transformation and employs prototype-based table inheritance for object-oriented behavior. The runtime covers a broad set of capabilities, including asynchronous

AlgorithmsByPython 是一个参考库和教育存储库，提供计算机科学基础知识的可运行 Python 实现。它作为算法模式、核心数据结构以及竞争性编程和技术面试挑战解决方案的综合指南。 该项目通过提供广泛的参考实现脱颖而出，包括一套专门针对常见 LeetCode 问题的解决方案。它专注于将理论计算逻辑转化为实用的 Python 代码，以供教育和实际使用。 该存储库涵盖了广泛的功能，包括线性集合、树和图的设计，以及搜索和排序策略的实现。它包括图论实用程序（如最短路径和最小生成树计算），并提供磁盘索引和文本模式匹配机制。

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 comprehensive library of type-safe, high-performance data structures for Go. By leveraging language-level generics, it provides reusable containers and algorithms that eliminate the need for runtime type assertions or interface casting, ensuring efficient and type-safe data management. The library distinguishes itself through its support for persistent data structures and specialized indexing. It utilizes copy-on-write semantics and memory sharing to maintain multiple versions of a collection, allowing for efficient modifications without duplicating entire datasets. Addition

This repository serves as a comprehensive resource for competitive programming and technical interview preparation. It provides a structured collection of source code implementations for fundamental data structures and classic algorithmic problems, designed to help developers master core computer science concepts and efficient coding strategies. Beyond standard problem-solving, the project distinguishes itself by integrating software design patterns into its algorithmic implementations. It demonstrates how to apply structural and behavioral patterns—such as decorators, observers, and singleto