Dynamic Programming21 sections · 916 units
Open in Course

Quiz: Prefix Sums Basics

Knowledge check

Check Your Understanding

What is the time complexity to answer a range sum query [L, R] after building a prefix sum array?

  1. A.O(1)
  2. B.O(n)
  3. C.O(R - L)
  4. D.O(log n)
Start the roadmap to answer the quizzes and solve the challenges