Algorithms & Techniques

Matrix Exponentiation

Compute linear recurrences like Fibonacci in O(log n) by raising a transformation matrix to a power.

Found this helpful? Subscribe for new deep-dives every week.

Subscribe

More in Algorithms & Techniques

Binary Lifting & Lowest Common Ancestor (LCA)

Preprocess a tree to answer ancestor and LCA queries in O(log n) using the binary lifting technique.