GeneralTable-stakes
Big O Notation
Also written as Time Complexity, Space Complexity, Algorithmic Complexity
A shorthand for how an algorithm's cost grows as the input grows — whether doubling the data doubles the work or squares it.
Think of it like
The difference between a queue that takes twice as long with twice the people, and one that takes four times as long.
Junior or senior?
Table-stakes for interviews and rarely the real differentiator.
Senior sounds like
Talks about where complexity mattered in practice, which is far less often than interviews suggest.
Ask them
“When did algorithmic complexity actually matter in something you shipped?”