CPP - Maximum Subarray Sum 1

#1

here in the code at line no 33 and 34, why left=i; and right =j; is done?

#2

hey @kuldeep.samal16kiit, it was mentioned to find the subarray which is giving maximum sum. if you add elements from index left to right than you will find that sum obtained is maximum sum obtained.

#3

hey @kuldeep.samal16kiit, you have reopen this thread,.Do you have any issue with this code.