Maximum Subarray Sum (divide and conquer) poblem

#1

i have coded this problem with simple two loops (o(nsquare) and it got accepted.
is this is corrected ethos or algo sholud be order of nlogn form

#2

maximum subarray sum can be done in O(n) using kadanes algorithm

#3

Hey we have notes this, and we will be fixing the test cases soon. This one is solved using Kadane’s algorithm.