Time Complexity Quiz

Master asymptotic analysis, recurrence relations, and algorithm complexity with carefully crafted questions. Every answer includes intuitive and formal explanations.

Interactive Solutions

Hint System

Dual Explanations (Simple + Formal)

Time Complexity — MIT 6.006 Question Bank

Complete quiz question set derived from MIT 6.006 problem sets. Master asymptotic analysis, recurrences, and algorithm complexity.

Total

Answered

Correct

—

Score

Filter:

Question 1 of 39intermediate

faangtricky

Nested Loop That Is NOT O(n²)

What is the time complexity of this code?

```python
def f(n):
    for i in range(n):
        j = 1
        while j < n:
            j *= 2
```

1 / 39

Questions adapted from MIT OpenCourseWare 6.006 problem sets and real FAANG interview questions. View original course →