4 个仓库
Provides DP-based solutions for edit distance, longest common subsequence, longest increasing subsequence, optimal string break points, and paragraph line breaking.
Distinct from Longest Common Substring Algorithms: Distinct from Longest Common Substring Algorithms: covers a broader set of string and sequence problems including edit distance and subsequence calculations.
Explore 4 awesome GitHub repositories matching software engineering & architecture · String and Sequence Algorithm Solutions. Refine with filters or upvote what's useful.
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 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.