Answer
Big-O describes how time or memory grows with input size n (the growth rate). It helps compare algorithms independent of hardware.
What is a monotonic queue and how does it solve sliding window max in O(n)? #deque#monotonic-queue#sliding-window