Skip to content

Add sequence, interval and graph algorithms with independent oracles - #3

Merged
pralav-25 merged 11 commits into
mainfrom
feat/sequence-interval-graph-tools
Sep 25, 2026
Merged

pralav-25 merged 11 commits into
mainfrom
feat/sequence-interval-graph-tools

Conversation

@pralav-25

Copy link
Copy Markdown
Owner

Add eleven sequence, interval, and graph algorithms: sliding minima, target-sum slice counts, maximum products, circular sums, inversion vectors, bitonic subsequences, interval covering/overlap/intersection, Gale-Shapley matching, and zero-one BFS.

Each module includes documented semantics and an executable example. Independent tests enumerate slices, subsets, paths, or stable matchings, and cover duplicates, ties, invalid input, and unreachable vertices. The catalog advances from 137 to 148 algorithms.

Validation: tests, doctests, Ruff lint, and formatting pass locally. Runtime dependencies remain empty.

@pralav-25
pralav-25 changed the base branch from feat/dynamic-programming-witnesses to main September 25, 2026 06:43
@pralav-25
pralav-25 merged commit 57afae4 into main Sep 25, 2026
3 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant