its working with the use of kadane’s algo, and a small modulo function, but the tescases are not passing. its not a time related issue either.
ive tried multiple examples, theyre all passing. please help.
Maximum circular sum challenge
Hey @ilovetocode in this approach you also need to subtract elements that are before the n window length under consideration like in the case of array {1, 2, 3, 4} your solution will be 16 but the total sum is 10, since you are not subtracting the elements that dont come under n elements big window your sum might exceed the solution.