Given an ArrayList of Integers, find a subarray with the maximum sum of any potential subarray within the ArrayList. A subarray is any combination of consecutive numbers. The subarray can be of any length n, where the size of n >= 0.

import java.util.ArrayList;

public class MaxSubArray{

public static ArrayList solution(ArrayList nums){

// your code goes here return new ArrayList<>();

}

}