Sherlock and Array

  • + 1 comment
    Have a look at this :)
    
    static String solve(int[] a){
            // Complete this function
            int sum=0;
            int lsum=0;
            int n=a.length;
            for(int i=0;i<n;i++){
                sum=sum+a[i];
            }
            int rsum=sum;
            for(int i=0;i<n;i++){
                rsum=rsum-a[i];
                if(rsum==lsum){
                    return "YES";
                }
                lsum=lsum+a[i];
            }
            
            return "NO";
        }