## Maximum sum of elements in two non-overlapping contiguous sub arrays

Question: Given an array A, find the sum of maximum sum of two non-overlapping subarrays, with lengths L and M. In other words, return the largest V for which V = (A[i] + A[i+1] …. A[i+L-1]) + (A[j] + A[j+1] …. A[j+M-1]) Input: A = {3, 8, 1, 3, 2, 1, 8, 9, 0}; L = 3, M… Read More »