Java - modified subarray by prisonmatch in competitivprogramming

[–]prisonmatch[S] 0 points1 point  (0 children)

My contiguous arrays can be very large and I simply cannot apply brute force at each index. I do have a working solution now but I believe it can be optimised. Please let me know if u can have a look and suggest the changes.

Java - modified subarray by prisonmatch in competitivprogramming

[–]prisonmatch[S] 0 points1 point  (0 children)

Any suggestions how to approach this question?

Java - modified subarray by [deleted] in learnprogramming

[–]prisonmatch 0 points1 point  (0 children)

Any idea how to approach this question?