Are you sure you're getting this? Click the correct answer from the options.
What is the time complexity of the dynamic programming solution for the maximum subarray sum problem?
A. O(n^2) B. O(n) C. O(log n) D. O(1)
Back to course sections
Mark As Completed Discussion