Design a linear-time algorithm that finds a contiguous subarray of length at most (m) in an array

Question:

Design a linear-time algorithm that finds a contiguous subarray of length at most $m$ in an array of $n$ long integers that has the highest sum among all such subarrays. Implement your algorithm, and confirm that the order of growth of its running time is linear.

Fantastic news! We've Found the answer you've been seeking!