Find triplets with zero sum

//{ Driver Code Starts
#include<bits/stdc++.h>
#include<stdlib.h>
#include<iostream>
using namespace std;

// } Driver Code Ends
/* You are required to complete the function below
*  arr[]: input array
*  n: size of array
*/
class Solution{
  public:
    //Function to find triplets with zero sum.
   bool findTriplets(int arr[], int n) {
   bool found = false;

   sort(arr, arr + n);

   for (int i = 0; i < n - 1; i++) {
     int l = i + 1;
     int r = n - 1;
     int x = arr[i];
     while (l < r) {
       if (x + arr[l] + arr[r] == 0) {

         l++;
         r--;
         found = true;
         break;
       } else if (x + arr[l] + arr[r] < 0)
         l++;
       else
         r--;
     }
     if (found) break;
   }

   return found;
 }
};

//{ Driver Code Starts.
int main()
{
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        int arr[n]={0};
        for(int i=0;i<n;i++)
            cin>>arr[i];
        Solution obj;
        if(obj.findTriplets(arr, n))
            cout<<"1"<<endl;
        else
            cout<<"0"<<endl;
    }
    return 0;
}
// } Driver Code Ends