how to approach this question??
Maximum circular sum
first case can be calculated by Kadane.
for second ques, if you multiply the array by -1 and then do kadane it will give min subarray.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.