Search
⌘K
Get Premium
Leetcode 2824. Count Pairs Whose Sum is Less than Target
Count the number of index pairs (i < j) in an array whose elements sum to less than a given target — a two-sum variant typically solved by sorting and using a two-pointer scan to count valid pairs efficiently (or by brute force given n ≤ 50).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.