CodingReported in a candidate post, Jul 2025
Count Triplets with Sum Constraint
Filed under Myntra
The question
Given an array a[], find the number of triplets (i, j, k) such that i < j < k, a[i] < a[j] < a[k], and a[i] + a[j] + a[k] <= t for a given sum t.
No write-up yet. Related questions below have one.
Related Myntra questions
Collected from public candidate posts and coding forums. Updated Nov 2026.