Search
⌘K
Get Premium
Leetcode 1925. Count Square Sum Triples
Count the number of ordered integer Pythagorean triples (a, b, c) with 1 ≤ a, b, c ≤ n — i.e., how many pairs (a, b) produce a^2 + b^2 = c^2 for some integer c ≤ n. The constraint n ≤ 250 makes a direct check over pairs feasible.
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.