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.

A fraction is considered simplified if its numerator and denominator have a greatest common divisor equal to $1$. The fractions can be returned in any order.

Constraints:

• $1 \leq$ n $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.