Given an array of n distinct integers, d =[d[0], d[1],.., d[n-1]], and an integer threshold ,t , how many (a, b,c) index triplets exist that satisfy both of the following conditions? d[a] < d[b] < d[c] d[a] + d[b] + d[c] ≤ t Function Description Complete the function triplets in the editor below. The function must return a long integer denoting the number of (a, b,c) triplets satisfying the given conditions: t: an integer treshold d[d[0],d[n-1]] : an array of integers Constraints:
1 ≤ n ≤ 10^4
0 ≤ d[i] < 10^9
0 < t < 3 x 10^9
C++ funtion:
long triplets(long t, vector d) {
}
Java function:
static long triplets(long t, List d) {
}
Python function:
def triplets(t, d):