Can we calculate the Maximum Subarray sum by doubling the array

#1

Doubling the array may increase the space complexity but it will actually do the job in fewer steps and all we need to do is apply kadane’s alorithm to the new array
suppose the array was 1,2,3,4,5
we make it 1,2,3,4,5,1,2,3,4,5 in this approach, we can actually get the maximum possible sub array if we set the maximum sub array size can be of the original length of array given

#2

@shubham.jhamb2000
yeah looks correct .it should work i guess.just code it and see what verdict u are getting

#3

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.