Repository navigation
Add dynamic-programming algorithms with reconstruction and oracle tests - #2
Merged
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Add ten dynamic-programming and sequence modules that expose useful counts, optimal values, or reconstruction witnesses: edit scripts, shortest common supersequences, palindromic subsequences, distinct-subsequence counts, change counts, bounded knapsack, rod cutting, minimum jumps, maximal squares, and triangle paths.
Each implementation documents its input assumptions, tie behavior, complexity, and executable example. Tests compare with exhaustive small cases, independent path/subset enumeration, or existing distance oracles. The catalog advances from 127 to 137 algorithms.
Validation: tests, doctests, Ruff lint, and formatting pass locally. Runtime dependencies remain empty.