please can you help me to initiate the problem, i am not able tto understand the problem.
Maximum circular sum
The question is same as the maximum sub array sum, even the input will be given as an array, but you have to find the maximum sum assuming that the input elements are arranged in a circle. The different thing in this question if that maximum sum can also come from the overlapping cases as well.