Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Implement a Simplified DNS Resolver
Coding · Concurrency · Data Structure Design
- 0/1 Knapsack Problem with Time Complexity Optimization
Coding
- 01 Matrix
Coding
- 1 leetcode hard complex dp questions
Coding
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 1447. Simplified Fractions
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source