Skip to content
Programmingoneonone
Programmingoneonone
  • Home
  • CS Subjects
    • Internet of Things (IoT)
    • 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
Programmingoneonone

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 solutions

Post navigation

Previous post
Next post

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2025 Programmingoneonone | WordPress Theme by SuperbThemes