Practice Simplified Fractions
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an integer n, return a list of all simplified fractions between 0 and 1 (exclusive) such that the denominator is less-than-or-equal-to n. You can return the answer in any order.
Source: Simplified Fractions on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
n = 2
Output
["1/2"]
# Example 2
Input
n = 3
Output
["1/2","1/3","2/3"]
# Example 3
Input
n = 4
Output
["1/2","1/3","1/4","2/3","3/4"]
Constraints
1 <= n <= 100
Related LeetCode Problems
Practice more problems similar to Simplified Fractions.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.