Awesome GitHub RepositoriesExpression Transformers

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

KaTeX is a typesetting library and web math renderer that transforms TeX and LaTeX mathematical notation into high-quality HTML and CSS for web browsers. It functions as a math notation parser and LaTeX to HTML converter, capable of operating as both a client-side library and a server-side math renderer to generate static HTML expressions. The project supports a wide range of specialized mathematical rendering, including chemical equation rendering, Bra-ket notation for quantum mechanics, and mathematical logic typesetting. It provides comprehensive controls for structural layouts such as mat

Rust-analyzer is a language server implementation that provides real-time code intelligence, static analysis, and development productivity tools for the Rust programming language. It functions as a backend engine that communicates with text editors to deliver deep structural understanding of source code, enabling features like semantic analysis, symbol navigation, and automated refactoring. The project distinguishes itself through a core engine designed for high-performance responsiveness, utilizing incremental query-based compilation and lazy demand-driven evaluation to minimize resource con

This project is a mathematics programming pattern library and translation guide designed to map academic mathematical symbols and formulas into programmable logic. It serves as a reference for converting complex notations into software implementations. The resource provides mapping guides for translating calculus, linear algebra, and set theory into iterative loops, functional code, and boolean expressions. It includes specific patterns for implementing piecewise functions, matrix operations, and standard mathematical operators using conditional logic and built-in language functions. The lib

This project is an algorithm template library and coding interview study guide providing reusable code patterns for common data structures and algorithms. It serves as a reference for optimized strategies and a structured learning path to build proficiency in algorithmic problem solving and competitive programming. The library focuses on standardized implementations of key algorithmic patterns, including sliding windows, backtracking, dynamic programming, and binary search. It provides specific templates for managing binary search trees, searching rotated sorted arrays, and executing divide-a

algorithm-base is an educational library and study guide designed for simulating algorithms and studying data structures. It functions as an execution visualizer that renders step-by-step state changes and pointer updates through animated simulations to illustrate how data movement works. The project distinguishes itself by mapping conceptual logic directly to multi-language source code implementations. It utilizes a comparative analysis framework to evaluate different algorithmic strategies based on stability, time complexity, and space complexity, while organizing problems by underlying mec

Macdown is a markdown text editor and HTML renderer designed for structured document composition. It provides a workspace for writing in lightweight markup syntax while simultaneously generating a live HTML preview of the rendered output. The editor distinguishes itself through a programmable interface, offering a command line utility to open files or pipe text directly into the application. It further supports extensibility via a plugin system that allows for the addition of custom features and functional modules at runtime. The application handles technical documentation requirements inclu

sqlglot is a SQL parser and transpiler that represents queries as abstract syntax trees to enable structural analysis, modification, and semantic transformation. It functions as a dialect translator and query optimizer, converting SQL code between different database engines and simplifying syntax trees through rule-based normalization. The project provides a framework for defining custom SQL dialects by overriding tokenizers, parsers, and generators. It includes a lineage analyzer to track data flow from source tables through complex queries to identify the origin of specific columns. Additi

Einops is a tensor manipulation library that provides a framework-agnostic interface for reshaping, Einstein summation, and multi-dimensional array operations. It serves as an abstraction layer that works across NumPy, PyTorch, TensorFlow, and JAX, allowing for tensor transformations without changing the API. The library distinguishes itself through a declarative notation system that uses readable string patterns to describe tensor rearrangements and reductions. This approach includes an extended Einstein summation interface that supports multi-letter axis names and a named dimension mapping

This project is a comprehensive collection of computer science implementations and an algorithm tutorial repository. It serves as a study guide and reference for competitive programming, providing executable code examples that demonstrate fundamental algorithmic problem solving and mathematical computation. The library covers a wide range of specialized domains, including cryptography and security primitives, lossless data compression techniques, and computational geometry for spatial analysis. It also features implementations of machine learning models, linear algebra operations, and formal

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

This project is a comprehensive Lisp AI implementation library that provides reference implementations for various artificial intelligence paradigms and symbolic algorithms. It functions as a multi-purpose toolkit containing a logic programming engine, a natural language processing suite, and a symbolic mathematics toolkit. The library is distinguished by its diverse architectural frameworks, including a Prolog-style execution engine that uses unification and goal-driven backtracking, and a system for simulating human decision-making through expert system shells and certainty factors. It also

arxiv-latex-cleaner is a utility designed to prepare LaTeX projects for submission to the arXiv preprint server. It functions as a document sanitizer and source cleaner, removing private comments, metadata, and sensitive information from LaTeX files. The tool optimizes document size by eliminating unused files and compressing graphics to meet strict upload limits. It further handles the externalization of complex drawing environments, replacing raw source code with references to pre-compiled image or PDF files to hide simulation data. The system performs source-to-source transformations to r

OnlineJudge is an automated platform for managing programming contests and evaluating submitted source code. It provides a complete online judge system that compiles, runs, and scores code submissions against predefined test cases within a sandboxed execution environment, ensuring the host system remains protected from untrusted user code. The platform supports both ACM-style penalty-based scoring and OI-style point-based scoring, with real-time leaderboard computation that dynamically updates participant rankings as submissions are judged. Contest organizers can create and schedule timed com

InvenTree is an open-source inventory management platform built on Django, designed for tracking parts, stock levels, and supply chain operations through a web interface and REST API. The system uses barcodes—including QR codes, 1D barcodes, and Data Matrix codes—as primary identifiers for scanning, linking, and triggering inventory actions, and extends core functionality through a Python plugin framework supporting custom actions, UI panels, barcode handlers, and scheduled tasks. The platform distinguishes itself through a comprehensive plugin-based extensibility system that allows custom in

is-thirteen 是一个数字验证库和数值相等性检查器，旨在验证给定输入是否等于十三。它充当数据分类工具，可识别跨数值、文本和视觉输入流的这一特定值。 该项目包含一个基于图像的数字分类器，使用深度学习和神经网络分析来识别上传图像中数字十三的视觉表现。 该库涵盖了多种验证方法，包括精确算术相等性、定义容差范围内的近似值匹配、科学计数法解析以及书写形式的语言模式匹配。

handcalcs 是一个数学文档生成器和 Python LaTeX 计算渲染器。它作为一个自动化计算表工具，将 Python 代码和数值计算转换为格式化的 LaTeX 数学文档，既作为符号数学格式化程序，也作为 Jupyter Notebook 数学扩展。 该项目将 Python 变量名转换为希腊符号、下标和标准数学符号。它将代码转换为格式化的数学表达式，显示原始公式、数值代入和最终结果，从而允许创建参数化计算表和人类可读的报告。 该工具涵盖了广泛的渲染功能，包括自动变量下标、内联注释集成和多列参数布局。它支持生成原始 LaTeX 代码、PDF 文档渲染，并与符号数学库集成以处理代数表达式。 该系统使用单元格魔法（Cell Magics）直接集成到 Jupyter Notebook 环境中，以实时显示格式化的方程。

Racket 是一种通用的、多范式编程语言，属于 Lisp 家族，专为语言创建而设计。它作为一个语言工作台，通过灵活的宏和模块系统，为设计和实现自定义编程语言提供了一个平台。 该系统的特色在于提供了一套全面的语义工程套件，允许构建专门的语言子集和教育层。它包括用于自定义语言设计的工具，如词法分析器和解析器生成，以及在读取时定义模块扩展规则和动态语言选择的能力。 该项目提供了一个集成开发环境，内置编辑器、可视化调试器和软件包管理器。其功能范围扩展到涵盖 2D 图形渲染、二进制数据处理、SQL 和演绎数据库集成以及图形用户界面构建的通用标准库。 该环境支持将源代码编译为独立的二进制可执行文件以进行分发。

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