Medium

Quiz

#1447 Simplified Fractions

APPROACH

Given a positive integer n, produce a list of every fraction strictly between 0 and 1 that is already in lowest terms and whose denominator is at most n. The result may be returned in any order.

Example 1:

Input: n = 2

Output: ["1/2"]

Explanation: "1/2" is the only unique fraction with a denominator less-than-or-equal-to 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"]

Explanation: "2/4" is not a simplified fraction because it can be simplified to "1/2".

1 of 4

1:00

What is the optimal approach for this problem?