solves relative ranks in python

Author: anishLearnsToCode

Diff for: README.md

@@ -134,7 +134,7 @@
 | 500 | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/KeyBoardRow.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/keyboard_row.py) |
 | 501 | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/FindModeInBinarySearchTree.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/find_mode_in_binary_search_tree.py) |
 | 504 | [Base 7](https://leetcode.com/problems/base-7) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/Base7.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/base_7.py) |
-| 506 | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | Easy | |
+| 506 | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | Easy | [![Python](https://img.icons8.com/color/35/000000/python.png)](python/relative_ranks.py) |
 | 507 | [Perfect Number](https://leetcode.com/problems/perfect-number) | Easy | |
 | 509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number) | Easy | |
 | 520 | [Detect Capital](https://leetcode.com/problems/detect-capital) | Easy | |

Diff for: python/relative_ranks.py

@@ -0,0 +1,20 @@
+from typing import List
+
+
+class Solution:
+    def get_rank(self, position: int) -> str:
+        if position == 1: return 'Gold Medal'
+        if position == 2: return 'Silver Medal'
+        if position == 3: return 'Bronze Medal'
+        return str(position)
+
+    def findRelativeRanks(self, score: List[int]) -> List[str]:
+        numbers = [(index, val) for index, val in enumerate(score)]
+        numbers.sort(key=lambda x: x[1], reverse=True)
+        value_to_index = {}
+        for index, (_, value) in enumerate(numbers):
+            value_to_index[value] = index
+        result = [''] * len(score)
+        for index, value in enumerate(score):
+            result[index] = self.get_rank(value_to_index[value] + 1)
+        return result