Big-O
Also written: Big O, O(n), time complexity
A way to describe how a solution's running time or memory grows as the input gets bigger, such as O(n) or O(n²). Interviewers expect you to state it for your solution.
Also written: Big O, O(n), time complexity
A way to describe how a solution's running time or memory grows as the input gets bigger, such as O(n) or O(n²). Interviewers expect you to state it for your solution.