Time Complexity · #19 · 2026-04-23
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?
from itertools import permutations
def all_perms(arr):
return list(permutations(arr))
Loading your progress...
Press 1 through 4, or tap a numbered choice, to answer. Back to hub