You are given an integer array score of size n, where score[i] represents the score of the $i^{ ext{th}}$ athlete in a competition. All scores are guaranteed to be unique.

The athletes are awarded ranks based on their scores, where the athlete with the highest score receives the $1^{ ext{st}}$ place rank, the athlete with the second highest score receives the $2^{ ext{nd}}$ place rank, and so on.

The placement ranks are decided as follows:

• The $1^{ ext{st}}$ place athlete is awarded "Gold Medal".

• The $2^{ ext{nd}}$ place athlete is awarded "Silver Medal".

• The $3^{ ext{rd}}$ place athlete is awarded "Bronze Medal".

• For the $4^{ ext{th}}$ place to the $n^{ ext{th}}$ place athlete, their rank is their placement number represented as a string (i.e., "$x$" for the $x^{ ext{th}}$ place).

Return an array answer of size n where answer[i] is the rank of the $i^{ ext{th}}$ athlete.

Constraints:

• n == score.length

• $1 \leq$ n $\leq 10^4$

• $0 \leq$ score[i] $\leq 10^6$

• All the values in score are unique.

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.