Blogs Hub

by Sumit Chourasia | Oct 17, 2020 | Category :coding | Tags : algorithm array data-structure easy leetcode

Relative Ranks - Array - Easy - LeetCode

Relative Ranks - Array - Easy - LeetCode

Given scores of N athletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Silver Medal" and "Bronze Medal".

Example 1:
Input: [5, 4, 3, 2, 1]
Output: ["Gold Medal", "Silver Medal", "Bronze Medal", "4", "5"]
Explanation: The first three athletes got the top three highest scores, so they got "Gold Medal", "Silver Medal" and "Bronze Medal". 
For the left two athletes, you just need to output their relative ranks according to their scores.
N is a positive integer and won't exceed 10,000.
All the scores of athletes are guaranteed to be unique.

public class Solution {
    public string[] FindRelativeRanks(int[] nums) {
        var map = new SortedDictionary<int,int>();
        var temp = nums;
        for(int i=0;i<nums.Length;i++){
        var res = new string[nums.Length];
        for(int i=0;i<nums.Length;i++){
                res[map[temp[i]]]="Gold Medal";
            else if(i==1){
                res[map[temp[i]]]="Silver Medal";
            else if(i==2){
                res[map[temp[i]]]="Bronze Medal";
        return res;

Time Complexity: O(nlogn)

Space Complexity: O(n)