InterviewForces Contest #1 (Div. 7) Editorial with Behind The Scenes and Bonus Problems

The editorial and behind-the-scenes notes for InterviewForces Contest #1, including solution ideas, testing stories, and bonus problems.

· 6 min · 1160 words · nor

InterviewForces Contest #1 (Div. 7)

The announcement for InterviewForces Contest #1, a Codeforces-style meme contest with nine problems.

Generalized Möbius Inversion on Posets

An introduction to Mobius inversion through incidence algebras of posets, with inclusion-exclusion, subset transforms, number theory, and finite differences as examples.

· 19 min · 3965 words · nor

Binary search and other "halving" methods

A beginner-friendly guide to binary search as partition-point search, including invariants, variants, language APIs, and optimizations.

GCC Optimization Pragmas

An explanation of GCC optimization and target pragmas, what common fake pragmas do not do, and when these flags help or hurt.

Traversing the complement graph in linear/near-linear time in multiple ways

A bunch of DFS and BFS ways to traverse a complement graph efficiently, including linear-time BFS and a DSU-style trick for the DFS case.