Awesome GitHub RepositoriesNotation Converters

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

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

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

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 est une bibliothèque de validation de nombres et un vérificateur d'égalité numérique conçu pour vérifier si une entrée donnée est égale à la valeur treize. Il fonctionne comme un outil de classification de données qui identifie cette valeur spécifique à travers des flux d'entrées numériques, textuelles et visuelles. Le projet inclut un classificateur de nombres basé sur l'image qui utilise le deep learning et l'analyse par réseau de neurones pour identifier des représentations visuelles du nombre treize au sein d'images téléchargées. La bibliothèque couvre une variété de méthodes de validation, incluant l'égalité arithmétique exacte, la correspondance de valeur approximative dans des plages de tolérance définies, le parsing de notation scientifique et la correspondance de motifs linguistiques pour les formes écrites du nombre.

handcalcs est un générateur de documentation mathématique et un rendu de calcul LaTeX Python. Il sert d'outil de feuille de calcul automatisé qui convertit le code Python et les calculs numériques en documentation mathématique LaTeX formatée, fonctionnant à la fois comme un formateur de mathématiques symboliques et une extension mathématique pour Jupyter notebook. Le projet transforme les noms de variables Python en symboles grecs, indices et notation mathématique standard. Il convertit le code en expressions mathématiques formatées qui affichent la formule originale, la substitution numérique et le résultat final, permettant la création de feuilles de calcul paramétrées et de rapports lisibles par l'humain. L'outil couvre un large éventail de capacités de rendu, incluant les indices de variables automatiques, l'intégration de commentaires inline et les mises en page de paramètres multi-colonnes. Il prend en charge la génération de code LaTeX brut, le rendu de document PDF et l'intégration avec des bibliothèques de mathématiques symboliques pour gérer les expressions algébriques. Le système s'intègre directement dans les environnements Jupyter notebook en utilisant des magics de cellule pour afficher des équations formatées en temps réel.

Racket est un langage de programmation généraliste multi-paradigme de la famille Lisp, conçu pour la création de langages. Il fonctionne comme un atelier de langage, fournissant une plateforme pour concevoir et implémenter des langages de programmation personnalisés via un système flexible de macros et de modules. Le système se distingue en offrant une suite complète pour l'ingénierie sémantique, permettant la construction de sous-ensembles de langages spécialisés et de couches éducatives. Il inclut des outils pour la conception de langages personnalisés, tels que la génération de lexer et de parser, ainsi que la capacité de définir des règles d'expansion de module et une sélection de langage dynamique au moment de la lecture. Le projet fournit un environnement de développement intégré avec un éditeur intégré, un débogueur visuel et un gestionnaire de paquets logiciels. Sa surface de capacités s'étend à une bibliothèque standard généraliste couvrant le rendu graphique 2D, le traitement de données binaires, l'intégration SQL et de bases de données déductives, et la construction d'interfaces utilisateur graphiques. L'environnement prend en charge la compilation du code source en fichiers exécutables autonomes pour la 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

Absinthe is a GraphQL server implementation and query engine for the Elixir ecosystem. It provides the fundamental toolkit for building GraphQL APIs, including a processing engine that parses, validates, and executes documents against a defined application schema. The project includes a batch resolver to optimize database performance by grouping field requests and a complexity guard to protect system resources by rejecting queries that exceed defined cost thresholds. It also features a schema adapter that translates internal Elixir naming conventions to external GraphQL casing for client comp

chess.js is a headless chess game logic engine and move validation library. It functions as a board state manager that enforces official rules, generates legal moves, and tracks game state without a user interface. The project provides comprehensive parsing and management for standard chess notations, including PGN for game histories and FEN for board configurations. It includes utilities for importing and exporting game records, managing PGN metadata, and handling position annotations. The engine covers a wide range of analysis capabilities, such as detecting game-ending conditions like che

CherryTree est une application de prise de notes hiérarchique et un éditeur de documents texte riche conçu pour organiser les informations au sein d'un arbre imbriqué de nœuds. Il fonctionne comme un outil de documentation intégré au code et une base de connaissances chiffrée, utilisant SQLite ou XML pour le stockage local des données. Le projet se distingue en intégrant des capacités centrées sur le développeur, telles que la coloration syntaxique et la capacité d'exécuter des blocs de code directement via un terminal externe. Il fournit également un chiffrement protégé par mot de passe pour sécuriser les données stockées et empêcher l'accès non autorisé à l'arbre d'informations. Le logiciel couvre un large éventail de capacités de gestion de contenu, y compris le rendu d'équations mathématiques LaTeX, la gestion des médias intégrés et l'hyperliage interne et externe. Il prend en charge la portabilité des données via l'importation de contenu externe et l'exportation multi-format vers PDF, HTML ou texte brut, parallèlement à des utilitaires de recherche et remplacement globaux.