Skip to content

Glossary: Coding Interviews in Go

Big-O

Also written: Big-O notation, target Big-O

A way of describing how a solution's running time or memory grows as the input gets bigger, such as O(n) or O(n²). It lets you compare approaches without timing them.

Where the book teaches it

Related terms

ConstraintsExponential time