Count triplets with sum smaller than a given value
Filed under Visa
The question
Count the number of triplets (i, j, k) with index i < j < k such that the sum of elements at arr[i], arr[j], and arr[k] is strictly less than a given value.
No write-up yet. Related questions below have one.
Related Visa questions
Collected from public candidate posts and coding forums. Updated Nov 2026.