Loading Company...
This is a verified interview question from Visa. Candidates reporting seeing this problem in recent Online Assessments (OAs) and onsite rounds. Mastering "Triplet Sum - Visa DTU" covers key patterns like Arrays.
"Given an array of n distinct integers, d = [d[0], d[1], ..., d[n-1]], and an integer threshold t, determine the number of (a, b, c) index triplets that satisfy both the conditions: - d[a] < d[b] < d[c] - d[a] + d[b] + d[c] ≤ t"
Join thousands of developers practicing for Visa.