Big O Notation | Dataford Interview Questions

Explain the Big O notation.

Implement classify_complexity(expression) to classify a valid polynomial expression in n by its highest nonzero power. The function receives a string such as 3n^2 + 5n + 7 and returns O(n^2), O(n), or O(1).

Contract

def classify_complexity(expression): accepts a string containing signed integer coefficients, optional powers, n, and constant terms, separated by optional whitespace.

Constraints

The input is a nonempty valid polynomial expression in n.
Terms contain optional signed integer coefficients, n, optional nonnegative integer powers, or integer constants.
Terms are separated by plus or minus signs, with optional whitespace.
Only the highest nonzero power determines the result.

Function Signature

def classify_complexity(expression):

Your question is Big O Notation. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem