bloom_filter
→
challenge_binary_search_answer
→
challenge_interval_scheduling
→
challenge_meet_in_middle
→
challenge_mo_algorithm_sum
→
challenge_ternary_search
→
challenge_two_pointers
→
count_min_sketch
→
cuckoo_filter
→
cuckoo_hashing
→
cycle_detection
→
exponential_search
→
hyperloglog
→
inversion_count
→
lru_cache
→
majority_vote
→
minhash_jaccard
→
misra_gries_heavy_hitters
→
mo_algorithm
→
monotonic_stack
→
morris_counter
→
mos_algorithm
→
online_median
→
permutation_rank
→
quickselect_median_of_medians
→
reservoir_sampling
→
simhash
→
skyline
→
sliding_window
→
sweep_line_max_overlap
→
t_digest
→
techniques
→
topk_heap
→
welford
→
zobrist_hash
→

loop_invariants_techniques

General algorithmic techniques with loop-invariant explanations

algorithms

techniques

competitive-programming

loop-invariants

moon add bobzhang/loop_invariants_techniques@0.17.0

Download zip

Author

bobzhang

Version

0.17.0

License

Apache-2.0

Repository

github.com/moonbit-community/loop_invariants

Last updated

2 months ago

Downloads

README

#Algorithmic Techniques

This module contains cross-cutting competitive-programming techniques, including two pointers, sliding windows, Mo's algorithm, binary search on answer, ternary search, meet-in-the-middle, monotonic structures, and interval scheduling.

Packages are organized as one 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