Count Pairs Whose Sum is Less than Target

Understand how to determine the number of distinct index pairs in an integer array whose sums are strictly less than a given target. Explore the two pointers approach for an efficient, step-by-step solution to solve this problem within specific constraints.