Leetcode 507. Perfect Number

Check whether a positive integer equals the sum of its proper positive divisors (excluding itself); the core challenge is efficiently finding and summing divisor pairs (using the sqrt(n) pattern) to handle n up to 1e8.