Category: Blog
-
How to Learn Heavy-Light Decomposition Algorithms: Heavy Edges, Tree Flattening, Path Queries and Segment Trees
A beginner-to-professional guide to heavy-light decomposition: why heavy and light edges limit path changes, how trees become array ranges, and how segment trees turn dynamic path queries into efficient operations.
-
How to Learn Cycle-Finding Algorithms: Floyd’s Tortoise–Hare, Brent’s Method, Functional Graphs and Constant Memory
A beginner-to-professional Learning Hall guide to cycle finding: understand functional graphs, trace Floyd’s tortoise-and-hare method, locate cycle entry and length, compare Brent’s algorithm, and reason about constant-memory sequence detection.
-
How to Learn Exact-Cover Algorithms: Algorithm X, Dancing Links, Constraint Matrices and Reversible Backtracking
A beginner-to-professional Learning Hall guide to exact cover: represent constraints as a 0–1 incidence matrix, trace Algorithm X, understand Dancing Links, and learn why reversible state changes make backtracking fast and reliable.
-
How to Learn Global Minimum-Cut Algorithms: Random Contraction, Stoer–Wagner, Failure Probability and Exact Cuts
A beginner-to-professional guide to global minimum cut: distinguish global cuts from s–t cuts, learn Karger’s random contraction and Stoer–Wagner, reason about probability and correctness, and choose the right algorithm for weighted graphs.
-
How to Learn Treaps: Randomized Priorities, Split–Merge Operations, Expected Balance and Sequence Design
A beginner-to-professional Learning Hall guide to treaps: combine the binary-search-tree and heap invariants, learn split and merge, understand expected logarithmic performance, and progress toward implicit treaps and sequence operations.
-
How to Learn Exact-Cover Algorithms: Algorithm X, Constraint Matrices, Dancing Links and Backtracking Heuristics
A beginner-to-professional Learning Hall guide to exact-cover algorithms: model constraints as a sparse matrix, trace Algorithm X, understand reversible cover/uncover operations, then progress to Dancing Links, heuristics and professional solver trade-offs.
