Count triplets in an array under a threshold
Filed under Mallow Technologies
The question
Given an array of n distinct integers and a threshold t, count the triplets (i, j, k) whose element sum satisfies the threshold condition (a sample with t=5 and values 1 2 3 4 6 gives 3).
No write-up yet. Related questions below have one.
Related Mallow Technologies questions
Collected from public candidate posts and coding forums. Updated Nov 2026.