Sync LeetCode submission Runtime - 449 ms (45.93%), Memory - 62.3 MB (99.94%)

Author: jimit105

0178-rank-scores/README.md

@@ -0,0 +1,55 @@
+<p>Table: <code>Scores</code></p>
+
+<pre>
++-------------+---------+
+| Column Name | Type    |
++-------------+---------+
+| id          | int     |
+| score       | decimal |
++-------------+---------+
+id is the primary key (column with unique values) for this table.
+Each row of this table contains the score of a game. Score is a floating point value with two decimal places.
+</pre>
+
+<p>&nbsp;</p>
+
+<p>Write a solution to find the rank of the scores. The ranking should be calculated according to the following rules:</p>
+
+<ul>
+	<li>The scores should be ranked from the highest to the lowest.</li>
+	<li>If there is a tie between two scores, both should have the same ranking.</li>
+	<li>After a tie, the next ranking number should be the next consecutive integer value. In other words, there should be no holes between ranks.</li>
+</ul>
+
+<p>Return the result table ordered by <code>score</code> in descending order.</p>
+
+<p>The result format is in the following example.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> 
+Scores table:
++----+-------+
+| id | score |
++----+-------+
+| 1  | 3.50  |
+| 2  | 3.65  |
+| 3  | 4.00  |
+| 4  | 3.85  |
+| 5  | 4.00  |
+| 6  | 3.65  |
++----+-------+
+<strong>Output:</strong> 
++-------+------+
+| score | rank |
++-------+------+
+| 4.00  | 1    |
+| 4.00  | 1    |
+| 3.85  | 2    |
+| 3.65  | 3    |
+| 3.65  | 3    |
+| 3.50  | 4    |
++-------+------+
+</pre>

0178-rank-scores/solution.py

@@ -0,0 +1,5 @@
+import pandas as pd
+
+def order_scores(scores: pd.DataFrame) -> pd.DataFrame:
+  scores['rank'] = scores['score'].rank(method='dense', ascending=False)
+  return scores[['score', 'rank']].sort_values('score', ascending=False)