Time Complexity · #47 · 2026-05-21
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.
n = len(arr). What is the time complexity?
def pairs(arr):
result = []
for i in range(len(arr)):
for j in range(i + 1, len(arr)):
result.append((arr[i], arr[j]))
return result
Loading your progress...
Press 1 through 4, or tap a numbered choice, to answer. Back to hub