I have used in Prefix method

long [] arr= new long[n+2];

 for (List<Integer> q: queries){
    int a= q.get(0);
    int b=q.get(1);
    int k=q.get(2);

     arr [a] +=k;
     arr [b+1] -=k;
     }
     long max=0,current=0;
     for(int i =1; i<=n;i++){
        current += arr[i];
        if(current > max){
            max = current;
        }
     }
     return max;
     }

}