C#: Find all triplets with zero sum

Difficulty Level: HARD

Problem Statement:

Given an array of distinct elements. The task is to find triplets in the array whose sum is zero.

Input:

arr[] = {0, -1, 2, -3, 1}

Output:

 (0 -1 1), (2 -3 1)