burst_balloons
→
challenge_bitmask_dp
→
challenge_bitmask_tsp
→
challenge_coin_change_min
→
challenge_edit_distance
→
challenge_knapsack_01
→
challenge_knapsack_unbounded
→
challenge_lcs
→
challenge_lis_nlogn
→
challenge_matrix_chain
→
challenge_palindrome_partition
→
coin_change_count
→
convex_hull_trick
→
distinct_subsequences
→
divide_conquer_dp
→
dp
→
held_karp_tsp
→
knuth_optimization
→
lis_reconstruction
→
longest_arithmetic_subseq
→
longest_bitonic_subseq
→
optimal_bst
→
sos_dp
→
word_break_count
→

loop_invariants_dp

Dynamic programming algorithms with loop-invariant explanations

algorithms

dynamic-programming

optimization

loop-invariants

moon add bobzhang/loop_invariants_dp@0.14.0

Download zip

Author

bobzhang

Version

0.14.0

License

Apache-2.0

Repository

github.com/moonbit-community/loop_invariants

Last updated

2 months ago

Downloads

README

#Dynamic Programming

This module contains dynamic-programming packages and optimizations, including knapsack, LCS, LIS, edit distance, bitmask DP, matrix chain multiplication, palindrome partitioning, and convex hull trick.

Packages are organized as one problem family or technique per directory. Each package contains a README.mbt.md tutorial with examples that are checked by moon test.

Run from the workspace root:

moon check
moon test
moon info
moon fmt

Site source Report issue Packages Build queue Skills Statistics