Leetcode 825. Friends Of Appropriate Ages

Count the number of ordered pairs (x → y), x ≠ y, such that age[y] > 0.5*age[x] + 7, age[y] ≤ age[x], and not (age[y] > 100 and age[x] < 100). The core challenge is efficiently counting pairs that satisfy these age-based inequalities (ages are bounded 1..120) without checking all O(n^2) pairs.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid August, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 825. Friends Of Appropriate Ages

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact