Time Complexity · #18 · 2026-04-22
What's the Big-O?
JavaScript ·Difficulty 2/3
How to play
Read the code and pick its time complexity from four Big-O choices. Think about loops, recursion, and hidden costs. Press 1–4 or click to answer.
What is the amortized time complexity per push?
const arr = [];
for (let i = 0; i < n; i++) {
arr.push(i);
}
Loading your progress...
Press 1 through 4, or tap a numbered choice, to answer. Back to hub