7 个仓库
Algorithms for determining the longest shared substring between strings using automata or match length aggregation.
Distinct from String Processing Algorithms: Focuses on the longest common substring problem, distinct from general string processing.
Explore 7 awesome GitHub repositories matching software engineering & architecture · Longest Common Substring Algorithms. Refine with filters or upvote what's useful.
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
Provides algorithms for finding the longest common substring shared between strings.
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
Offers DP-based solutions for calculating edit distance and longest common subsequences.
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
Identifies the longest contiguous sequence of characters in a string that contains no repeating characters.
该项目是一个高性能 Java 库和内容审核框架,旨在检测并屏蔽文本中的违禁词。它利用确定性有限自动机 (DFA) 扫描器来实现高效的最长匹配词检测。 该引擎以文本规范化管线和噪声过滤预处理器为特色,这些组件标准化字符大小写、脚本和宽度,同时删除散布的特殊字符以防止过滤规避。它支持动态字典管理,允许在后台更新黑名单和白名单,而无需重启系统。 该框架涵盖了广泛的审核功能,包括用于违规分类的基于标签的词汇分类、用于处理嵌套敏感词的递归匹配处理,以及用于识别 URL 和电子邮件地址等结构化数据的模式检测。它还包括用于输入清理的实用程序,以删除 HTML 标签和脚本元素。
Prioritizes the longest matching sequence from the dictionary to ensure precise identification of complex sensitive phrases.
This repository is a comprehensive collection of fully worked solutions to exercises and problems from the standard algorithms textbook by Cormen, Leiserson, Rivest, and Stein (CLRS). It serves as an educational reference for algorithm design and analysis, providing step-by-step reasoning, pseudocode, and mathematical proofs for a wide range of topics. The content spans core computer science areas: algorithm analysis with asymptotic notation, recurrence solving, and amortized cost analysis; data structure implementation and operations for binary search trees, red-black trees, B-trees, Fibonac
Provides DP-based solutions for edit distance, longest common subsequence, longest increasing subsequence, optimal string break points, and paragraph line breaking.
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
Provides DP-based solutions for finding the longest common substring and subsequence between two strings.
This project is a comprehensive repository of fundamental computer science algorithms and data structures designed as a reference for academic study, technical interview preparation, and competitive programming. It provides standardized implementations of core computational strategies, serving as an educational resource for developers to master software engineering fundamentals and algorithmic problem-solving. The collection distinguishes itself through a multi-language approach, offering cross-language solutions for complex tasks ranging from graph traversal and dynamic programming to bitwis
Provides string and sequence manipulation algorithms including pattern matching and reversal.