In this guide, you will get 178. Rank Scores LeetCode Solution with the best time and space complexity. The solution to Rank Scores problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
+————-+———+
| 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.
Write a solution to find the rank of the scores. The ranking should be calculated according to the following rules:
The scores should be ranked from the highest to the lowest.
If there is a tie between two scores, both should have the same ranking.
After a tie, the next ranking number should be the next consecutive integer value. In other words, there should be no holes between ranks.
Return the result table ordered by score in descending order.
The result format is in the following example.
Example not found
Constraints not found
Complexity Analysis
Time Complexity: Google AdSense
Space Complexity: Google Analytics
178. Rank Scores LeetCode Solution in C++
SELECT
score,
DENSE_RANK() OVER(ORDER BY score DESC) AS `rank`
FROM Scores; /* code provided by PROGIEZ */
