Dynamic Programming21 sections · 916 units
Open in CourseQuiz: Range Query Complexity
Understanding the tradeoff
Check Your Understanding
For m range sum queries on an array of size n, what is the total complexity using prefix sums?
- A.O(m log n)
- B.O(n + m)
- C.O(n^2)
- D.O(n * m)