3Sum Smaller

Count the number of index triplets (i<j<k) in an integer array whose sum is strictly less than a given target. The challenge is to do better than O(n^3) brute force—typically by sorting and using a two-pointer scan to count qualifying pairs for each fixed first element.