Vidyalelo
Data Structure · Q129

Dynamic Programming in Data Structures

Programming · Data Structure · question 129

Q129

What is the time complexity of the brute force implementation of the maximum sum rectangle problem?

A.
O(n)
B.
O(n2)
C.
O(n3)
D.
O(n4)
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board