Cover illustration for “Generating Functions for Competitive Combinatorics”

Essay Problem Solving

Generating Functions for Competitive Combinatorics

How algebraic manipulation of power series solves combinatorial recurrences instantly.

Tobias Wendler11 min read

Problem Solving · String Algorithms

A blog and newsletter on Competitive programming techniques and IOI-style problem breakdowns.

Cover illustration for “Z-Function vs KMP Failure Function in String Problems”

Essay String Algorithms

Z-Function vs KMP Failure Function in String Problems

Z-function works forward, KMP looks back—pick the one that matches your problem's natural direction.

Adaeze Nwofor · 7 min read

A recurrence comes in, a generating function goes out, and the coefficients fall out of the algebra.
From Generating Functions for Competitive Combinatorics