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 ist eine Bibliothek zur Zahlenvalidierung und numerischen Gleichheitsprüfung, die entwickelt wurde, um zu verifizieren, ob eine gegebene Eingabe dem Wert dreizehn entspricht. Sie fungiert als Datenklassifizierungstool, das diesen spezifischen Wert über numerische, textuelle und visuelle Eingabeströme hinweg identifiziert. Das Projekt enthält einen bildbasierten Zahlenklassifizierer, der Deep Learning und neuronale Netzwerkanalyse nutzt, um visuelle Repräsentationen der Zahl dreizehn in hochgeladenen Bildern zu erkennen. Die Bibliothek deckt eine Vielzahl von Validierungsmethoden ab, darunter exakte arithmetische Gleichheit, approximative Wertübereinstimmung innerhalb definierter Toleranzbereiche, Parsing wissenschaftlicher Notation sowie linguistisches Pattern-Matching für geschriebene Formen der Zahl.

handcalcs ist ein mathematischer Dokumentationsgenerator und Python-LaTeX-Berechnungs-Renderer. Er dient als automatisiertes Berechnungstabellen-Tool, das Python-Code und numerische Berechnungen in formatierte LaTeX-mathematische Dokumentationen umwandelt, und fungiert sowohl als symbolischer Mathe-Formatierer als auch als Jupyter-Notebook-Mathe-Erweiterung. Das Projekt wandelt Python-Variablennamen in griechische Symbole, Indizes und mathematische Standardnotation um. Es konvertiert Code in formatierte mathematische Ausdrücke, die die ursprüngliche Formel, die numerische Substitution und das Endergebnis anzeigen, was die Erstellung parametrisierter Berechnungstabellen und menschenlesbarer Berichte ermöglicht. Das Tool deckt eine breite Palette an Rendering-Funktionen ab, einschließlich automatischer Variablenindizes, Inline-Kommentar-Integration und mehrspaltiger Parameter-Layouts. Es unterstützt die Generierung von rohem LaTeX-Code, PDF-Dokument-Rendering und die Integration mit symbolischen Mathe-Bibliotheken zur Handhabung algebraischer Ausdrücke. Das System integriert sich direkt in Jupyter-Notebook-Umgebungen unter Verwendung von Cell-Magics, um formatierte Gleichungen in Echtzeit anzuzeigen.

Racket ist eine Mehrzweck-Programmiersprache mit mehreren Paradigmen aus der Lisp-Familie, die für die Sprachschöpfung entwickelt wurde. Sie fungiert als Sprach-Workbench und bietet eine Plattform zum Entwerfen und Implementieren benutzerdefinierter Programmiersprachen durch ein flexibles System aus Makros und Modulen. Das System zeichnet sich durch eine umfassende Suite für Semantik-Engineering aus, die den Aufbau spezialisierter Sprach-Subsets und Bildungsschichten ermöglicht. Es enthält Tools für das Design benutzerdefinierter Sprachen, wie Lexer- und Parser-Generierung, sowie die Fähigkeit, Modul-Erweiterungsregeln und dynamische Sprachauswahl zur Lesezeit zu definieren. Das Projekt bietet eine integrierte Entwicklungsumgebung mit eingebautem Editor, visuellem Debugger und einem Software-Paketmanager. Die Funktionspalette erstreckt sich auf eine Standardbibliothek für allgemeine Zwecke, die 2D-Grafik-Rendering, Binärdatenverarbeitung, SQL- und deduktive Datenbankintegration sowie den Bau grafischer Benutzeroberflächen abdeckt. Die Umgebung unterstützt das Kompilieren von Quellcode in eigenständige ausführbare Dateien für die Distribution.

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