How we can track which array has highest sum using kadanes algo and in linear time?
How we can track which array has highest sum?
in order to track which array has highest sum you have to update keep an start and end pointer and update them every time max ending here is greater than max so far.
Code:
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.