Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1925. Count Square Sum Triples
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source