Please provide a video explaining the solution for this question as I’m not able to understand it with the solution provided.
Please provide a video explaining the solution
this is not that hard problem
there are fixed steps to solve it
but still if you want a video you can request at [email protected]
Approach
There can be two cases for the maximum sum if we consider circular sum as well:
Case 1: The elements that contribute to the maximum sum are arranged such that no wrapping is there. Examples: {-10, 2, -1, 5}, {-2, 4, -1, 4, -1}. In this case, Kadane’s algorithm will produce the result.
Case 2: The elements which contribute to the maximum sum are arranged such that wrapping is there. Examples: {10, -12, 11}, {12, -5, 4, -8, 11}. In this case, we change wrapping to non-wrapping. find out the sum of non contributing elements and subtract this sum from the total sum. To find out the sum of non contributing, invert sign of each element and then run Kadane’s algorithm…
Finally we compare the sum obtained by both cases, and return the maximum of the two sums.
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.