I came across this problem on hacker earth contest. I was only able to think of a solution in O(n^2) time complexity. Can anyone share their approach with better time complexity.
Help needed in hackerearth maximum subarray sum problem
I came across this problem on hacker earth contest. I was only able to think of a solution in O(n^2) time complexity. Can anyone share their approach with better time complexity.