Back to Big-O Notation
Practice
Cycles through all question types automatically
Live Mastery
0%Good enough
0
Answered
0
Correct
0
Streak
0
Best
Round 1 · Q1/10
intermediate
An algorithm takes 1 second for n=100. If complexity is O(n²), approximately how long for n=1000?
1–4 to select · Space to skip · Enter to advance
Multiple Choice is endless — keep going as long as you like. Mastery updates after every answer.