Time Complexity · #16 · 2026-04-20
What's the Big-O?
Python ·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.
a and b are Python sets with m and n elements respectively. What is the time complexity?
def intersect(a, b):
return a & b
Loading your progress...
Press 1 through 4, or tap a numbered choice, to answer. Back to hub