How to solve this problem

#1

how to use kades algorithm in this algorithm

#2

hi @hhiteshbansal_40d12e2460a1738e,
one way is to make an array twice of previous array say a[] = {1,2,3}
make b[] ={1,2,3,1,2,3} now you can apply kadane directly maintainig size of n

#3

how to decide where to stop

#4

@hhiteshbansal_40d12e2460a1738e you need to maintain a window of n
check this : https://ide.codingblocks.com/s/655937

#5

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.