Find triplets with zero sum | GFG POTD 8 July #coding #compititiveprogramming

[OnlineClasses-rsyf]

Code used is following-
bool findTriplets(int arr[], int n)
{
//Your code here
unordered_map<int, int> idxs;
for (int i = 0; i < n; i++)
idxs[arr[i]] = i;

for (int ptr1 = 0, ptr2 = 1; ptr1 < n - 2; ptr2++)
{
if (ptr2 == n)
{
ptr1++;
ptr2 = ptr1 + 1;
}
if (idxs[-arr[ptr1] - arr[ptr2]] > ptr2)
return 1;
}
return 0;
}