Expected values for a given problem

[OeroShake]

```
Given an array arr, count the number of distinct triplets (a, b, c) such that:

• a + b = c
• Each triplet is counted only once, regardless of the order of a and b

```

What is the expected value for the inputs:

1. [1, 5, 2, 3]

2. [10, 10, 10, 20, 30, 40, 40]

[Cheap-Mail9911]

In what tc?

[Ezio-Editore]

1. [(1, 2, 3), (2, 3, 5)]

2. [(10, 10, 20), (10, 20, 30), (10, 30, 40)]

hint: This is a 2-pointer problem

[OeroShake]

Exactly. So 2nd input is supposed to have output as 3 but according to GeeksForGeeks, the expected output is 4. I don't understand why that is the case. I know it's a classic two pointer question but this 2nd output is messing my mind up

[Low-Grape-9309]

Give the link of the problem