You are viewing a single comment's thread. Return to all comments →
I was able to make a code that passes 11/19 cases in C#.
public static long maximumSum(List<long> a, long m) { SortedList<long, int> results = new SortedList<long, int>(); long max = 0, sum = 0, maxInResults = 0; foreach (long l in a) { sum = (sum + l) % m; if (!results.ContainsKey(sum)) { results.Add(sum, 0); if (sum >= maxInResults) { maxInResults = sum; max = Math.Max(max, sum); } else { int index = results.IndexOfKey(sum) + 1; long min = results.ElementAt(index).Key; max = Math.Max(max, sum - min + m); } } } return max; }
Seems like cookies are disabled on this browser, please enable them to open this website
Maximum Subarray Sum
You are viewing a single comment's thread. Return to all comments →
I was able to make a code that passes 11/19 cases in C#.