Time Complexity · #50 · 2026-05-24
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.
n = len(arr). What is the time complexity?
def has_duplicate(arr):
arr.sort()
for i in range(1, len(arr)):
if arr[i] == arr[i - 1]:
return True
return False
Loading your progress...
Press 1 through 4, or tap a numbered choice, to answer. Back to hub