Find triplets with zero sum

/*Complete the function below*/


class Solution
{
    // arr[]: input array
    // n: size of the array
    //Function to find triplets with zero sum.
	public boolean findTriplets(int arr[] , int n)
    {
        //add code here.
        
        Arrays.sort(arr);
        
        for(int i=0; i<n-1;i++)
        {
            
            int left = i+1, right = n-1;
            
            while(left < right)
            {
                
                int sum = arr[i]+ arr[left] + arr[right];
                if(sum == 0)
                {
                    
                    return true;
                }
                else if(sum < 0)
                {
                    
                    left++;
                }
                else if(sum > 0)
                {
                    right--;
                    
                }
                
                
                
                
            }
            
        }
        
        return false;
        
        
        
        
        
        
        
        
        
    }
}