Maximum circular sum

import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int t=sc.nextInt();
for(int k=0;k<t;k++) {
int n=sc.nextInt();
int[]arr1= new int[n];
for(int i=0;i<arr1.length;i++){
arr1[i]=sc.nextInt();
}
sum(arr1);
}
}

private static void sum(int[] arr1) {
    long sum1=0;
    for(int i=0;i<arr1.length;i++){
        long sum2=0;

// find left sum
for(int j=0;j<=i-1;j++){
sum2=sum2+arr1[j]+0l;
}
// fing r sum
for(int j=i+1;j<arr1.length;j++){
sum2=sum2+arr1[j]+0l;
}
sum1=Long.max(sum1,sum2);
}
System.out.println(sum1);

}

}

test cases are not working though i think code is right