Boyer–Moore–Horspool search: Examples & Code
Boyer–Moore–Horspool search: Search with a right-to-left comparison and a bad-character shift table. Explore a worked example, complexity and tested code.
Explore algorithm visualizations code snippets and tutorials
Boyer–Moore–Horspool search: Search with a right-to-left comparison and a bad-character shift table. Explore a worked example, complexity and tested code.
Rabin–Karp string search: Search with a rolling hash, verifying characters when hashes match. Explore a worked example, complexity and tested code.
Unique monotone grid paths: Count paths from top-left to bottom-right, moving only right or down. Explore a worked example, complexity and tested code.
Coin-change combination count: Count unordered combinations using unlimited coins. Repeated denominations are counted once. Explore a worked example,…
Subset sum: Process subtotals backward so each item can be used at most once. Explore a worked example, complexity and tested code.