Time Complexity · #49 · 2026-05-23
What's the Big-O?
Python ·Difficulty 1/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.
d is a Python dict with n entries. What is the average-case time complexity?
def has_key(d, key):
return key in d
Loading your progress...
Press 1 through 4, or tap a numbered choice, to answer. Back to hub