Max circular sum code

#1


i iterated over every element in circular manner using kadanes algo ,resulting in O(n^2) sol.
pls tell what will be the O(n) approach to this

#2

In this question, firstly you are supposed to find the component 1 using the kadane’s algo. Then you have to reverse all the elements of array and again determine component 2 using the same approach. Then you have to take max of component 1 and component 2. For further explanations, you can refer to the pdf hint given in online lecture.