# Assign a dense rank to products by price from highest to lowest, so tied prices share a rank and the

Canonical URL: <https://datadriven.io/problems/assign-a-dense-rank-to-products-by-price-from-highest-to-low-4b9b6d77>

Domain: SQL · Difficulty: medium

## Problem

Assign a dense rank to products by price from highest to lowest, so tied prices share a rank and the next rank has no gap.

## Related

- [All practice problems](https://datadriven.io/problems)
- [Mock interview mode](https://datadriven.io/interview/assign-a-dense-rank-to-products-by-price-from-highest-to-low-4b9b6d77)
- [SQL Interview Questions](https://datadriven.io/sql-interview-questions)
- [Data Engineering Interview Prep Guide](https://datadriven.io/data-engineer-interview-prep)
- [Daily Challenge](https://datadriven.io/daily)

---

Source: DataDriven (https://datadriven.io). 100% free data engineering interview prep. Live code execution against Postgres 16, Python 3.11, and Spark sandboxes. No paywall, no premium tier, no signup gate.