Time Complexity · #28 · 2026-05-02
What's the Big-O?
Python ·Difficulty 3/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 of heapify?
import heapq
def build_heap(arr):
heapq.heapify(arr)
return arr
Loading your progress...
Press 1 through 4, or tap a numbered choice, to answer. Back to hub