Search
⌘K
Leetcode 1447. Simplified Fractions
Return all reduced fractions a/b with 0 < a < b ≤ n (i.e., gcd(a,b)=1) that lie between 0 and 1; with n ≤ 100 a straightforward O(n^2) enumeration of numerator/denominator pairs is sufficient.
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.