Algorithms: Finding a min subarray. What is the correct answer?

A problem similar to finding the maximum-subarray is to find the minimum-subarray. Given you have an algorithm to find the maximum-subarray, how would you change it to find the minimum-subarray? The minimum-subarray problem cannot be reduced to the maximum-subarray problem. Multiply all numbers in the input by negative 1 to create a new input Find the maximum sub array on this input and multiply by all numbers by negative 1 again before returning it. An empty array will always be the minimum-subarray and therefore for any input we may just return an empty array