My Python solution - O(n) Kadane one pass, beats 82% - Maximum Sum Circular Subarray