Skip to content
Programming101
Programming101

Learn everything about programming

  • Home
  • CS Subjects
    • IoT – Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programming101
Programming101

Learn everything about programming

Leetcode Rank Scores problem solution

YASH PAL, 31 July 2024

In this Leetcode Rank Scores problem solution, we need to write a SQL query to rank scores. If there is a tie between two scores, both should have the same ranking. Note that after a tie, the next ranking number should be the next consecutive integer value. In other words, there should be no “holes” between ranks.

Leetcode Rank Scores problem solution

Problem solution in MYSQL.

select s1.Score, count(distinct s2.Score) as Rank from Scores s1, Scores s2
where s2.Score >= s1.Score
group by s1.Id
order by Rank
;

Problem solution in Oracle.

select score "Score",rankno "Rank"
from(
select score,dense_rank() over(order by score desc ) rankno
from scores);

Problem solution in MS SQL.

SELECT score,
DENSE_RANK() OVER (ORDER BY score DESC) AS Rank
FROM scores

coding problems

Post navigation

Previous post
Next post
  • HackerRank Separate the Numbers solution
  • How AI Is Revolutionizing Personalized Learning in Schools
  • GTA 5 is the Game of the Year for 2024 and 2025
  • Hackerrank Day 5 loops 30 days of code solution
  • Hackerrank Day 6 Lets Review 30 days of code solution
©2025 Programming101 | WordPress Theme by SuperbThemes