Circular sum program shows timelimit exceeded

#1

i tried reducing array sizes too but no help

#2

Please use kadane’s algorithm to solve this problem.

#3

sir firstly please tell me why this code goes over time limit and how can i use kadane circularly sir, i am applying kadanes logic itself

#4

your code is O(n^2) which would time our when n = 10^5, so you need to use kadane which is O(n)
Please refer to this article in order to understand how we would use kadane’s to find maximum circular subarray sum

#5
#6

abhi bhi galat hai code

#7

input format was wrong
Corrected Code