Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. A subarray is a contiguous part of an array. • What is the ...

You are given an integer array nums consisting of n elements, and an integer k. Find a contiguous subarray whose length is equal to k that has the maximum average ...

- oh no! Time-limit exceeded on a 4 cases... - need to cut-down on cases where it wouldn't be possible then somehow - if we save only the max and min of the prev (k-1), rather than all products - the ...

⊛ The brute force approach is find the all possible subarrays and calculate the sum. (Time complexity: O(N^3) ⊛ We only need to calculate the maximum sum so we can avoid our third loop and when ever ...