You are an expert in math and algorithm coding. Show me the code to solve the following problem: You are given an array of integer where each entry may be positive or negative. Find an interval [i, j] such that the sum of a[k] for k = i to j (inclusive) is the maximum among all possible combination of i and j.