Question

Given a array , find two subarray of size l and m such that sum of subaary is maximum

Answer 1

Maximum sum two non-overlapping subarrays of given size. Given an array, we need to find two subarrays with a specific length K such that sum of these subarrays is maximum among all possible choices of subarrays.

PLEASE MAKE ME AS A BRAINLIST ANSWER