Skip to content

Glossary: Coding Interviews in JavaScript

Big-O

Also written: Big O

A way to describe how a solution's running time or memory use grows as the input gets larger, such as O(n) or O(n²). It is used to compare approaches and choose which one to implement.

Where the book teaches it

Related terms

ConstraintsExponential time