14 个仓库
Algorithms for processing and comparing sequential data structures.
Distinct from Standard Library Implementations: Distinct from standard library containers: focuses on algorithmic logic for sequence manipulation like subsequences.
Explore 14 awesome GitHub repositories matching programming languages & runtimes · Sequence Algorithms. Refine with filters or upvote what's useful.
This repository is a comprehensive collection of data structures and algorithms implemented in JavaScript, designed primarily as an educational resource for computer science study and technical interview preparation. It provides modular implementations of fundamental programming concepts, allowing developers to explore algorithmic logic and data organization through self-contained, verifiable code examples. The library distinguishes itself by pairing every implementation with formal Big O notation, providing predictable insights into time and space scaling requirements. Each algorithm is stru
Implements bracket balancing algorithms to verify correct nesting and sequence validity.
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
Shuffles elements within containers or ranges using controlled random sources to ensure unbiased ordering in test datasets.
xi-editor is a high-performance text editor core written in Rust. It employs a client-server architecture that separates the backend editor logic from the user interface, allowing diverse frontends to communicate with the core via a standardized protocol. The project is distinguished by its use of rope-based text buffers for efficient manipulation of large documents and a collaborative engine powered by conflict-free replicated data types to synchronize concurrent edits. It further features an extensible plugin system that integrates external binaries and third-party tools through JSON-based
Uses a non-commutative monoid to implement bracket balancing and locate corresponding brackets for the cursor.
This project is a library of source code implementations designed to solve algorithmic challenges and mathematical problems. It serves as a collection of solved LeetCode problems, providing a reference for data structure usage and efficient logic. The repository is a polyglot code collection, implementing the same algorithmic logic across various programming environments, including general-purpose languages, SQL for database queries, and Bash for shell scripting. The content covers a broad range of computational tasks, including data querying, text processing, and the implementation of compl
Implements a system to replace bracketed keys with corresponding knowledge base values.
Nim is a statically typed, compiled systems programming language designed for high performance and cross-platform development. It translates high-level source code into C, C++, or JavaScript, allowing developers to produce efficient native binaries or web-compatible scripts from a single codebase. The language emphasizes a clean, indentation-based syntax that simplifies code hierarchy while maintaining the power of a full-featured systems language. What distinguishes Nim is its robust metaprogramming framework, which allows developers to inspect, modify, and generate code structures during th
Provides utility functions for sorting, searching, and processing sequential data structures.
This project is a comprehensive library of reference implementations for fundamental data structures and algorithms, designed to support technical interview preparation and software engineering assessments. It provides a structured collection of computational techniques for solving complex problems involving arrays, strings, graphs, trees, and mathematical analysis. The library distinguishes itself by offering specialized implementations for advanced topics, including concurrent programming patterns and geometric algorithms. It features thread-safe primitives for managing shared state and tas
Generates permutations, combinations, and interleavings of input elements.
This project is a comprehensive productivity guide and configuration reference for the VS Code editor. It provides a curated collection of shortcuts, configuration tips, and tutorials designed to improve efficiency and optimize the daily coding workflow. The resource covers advanced AI-assisted development, including the integration of autonomous agents, custom prompt files, and AI-powered coding assistants for task automation and code generation. It also provides specialized guidance on integrated terminal management, such as configuring shell profiles and automating command execution. Addi
Guides users on highlighting and jumping between corresponding bracket pairs for easier code navigation.
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
Provides a reference implementation of the Fisher-Yates algorithm for uniformly random array shuffling.
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
Rearranges array elements into uniformly random permutations using the Fisher-Yates algorithm.
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
Implements randomization algorithms such as the Fisher-Yates shuffle for uniform sequence redistribution.
Radash 是一个 TypeScript 函数式实用工具库,专为数据转换、验证和工作流管理而设计。它提供了一系列类型化的辅助函数来操作数组、对象和字符串。 该项目具有用于管理 Promise、重试和并发限制的异步工作流工具包,以及一套用于验证原始类型、对象和 Promise 的布尔验证器。它还实现了函数式编程模式,如函数组合、偏函数应用和错误优先响应模式。 该库涵盖了广泛的功能,包括具有深克隆和合并的对象状态管理、复杂的数组操作和字符串格式化。它还提供了用于执行优化的工具,如速率限制和结果缓存。
Provides an array shuffling utility to rearrange elements in a random sequence.
这是一个 C++ Ranges 库和标准模板库 (STL) 的扩展,提供了一系列用于处理数据序列的可组合算法和惰性视图。它作为惰性序列处理框架和模板元编程库,用于操作类型列表并执行编译时类型计算。 该项目通过使用管道语法和偏函数应用,在 C++ 中实现了函数式编程模式,从而创建可读的、从左到右的数据转换链。它允许构建按需过滤和转换元素的惰性数据流水线,以减少内存开销并避免不必要的拷贝。 该库涵盖了广泛的能力领域,包括序列操作、编译时类型操作以及自定义范围类型和迭代器的实现。它提供了用于急切的原地容器修改、基于投影的算法分发以及通过一系列类型级可调用对象管理类型列表的工具。
Implements standardized sequence algorithms with a unified interface for both iterator pairs and range objects.
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
Produces all valid combinations of balanced parentheses through recursive tracking of open and closed brackets.
nvim-autopairs 是一个基于 Lua 的 Neovim 扩展,可自动插入闭合括号、引号和关键字,以保持语法平衡。它作为一个上下文括号自动化工具,利用 Tree-Sitter 结构节点来根据代码的实际语法树确定何时插入或跳过闭合字符。 该插件的独特之处在于利用 Tree-Sitter 感知功能,防止在字符串或注释内部插入配对字符。它支持动态闭合字符串解析和自定义配对逻辑,允许用户使用正则表达式和文件类型过滤器定义特定规则。 除了基本的插入功能外,该工具还管理同步配对删除、选定块的文本包裹以及换行块格式化。它还与补全引擎集成,可在选择函数或方法后自动插入闭合字符。
Manages balanced pairs using rules based on filetypes, regular expressions, and cursor position.