N039-H2 Tier 3 · Intermediate · hard ecommerce · Brightlane

Return the ID, customer ID, and total amount of every order, plus the order's dense rank within that customer's orders by `total_amount` in descending order. Sort the final result by `customer_id` ascending and `total_amount` descending

Part of ROW_NUMBER, RANK, DENSE_RANK in SQL

The problem

Brightlane's category manager wants to see how orders rank within each customer's history by amount, using a position method that keeps tied amounts together and never skips a position.

Write a query to return the ID, customer ID, and total amount of every order, plus the order's dense rank within that customer's orders by total_amount in descending order. Sort the final result by customer_id ascending and total_amount descending.

Assumptions:

  • Within each customer's orders, rank 1 goes to the highest total_amount. Rank values restart for each customer.
  • Orders for the same customer with the same total_amount receive the same rank, and the next rank value is always exactly one higher.
  • The final result is sorted by customer_id ascending and then by total_amount descending.

Output:

  • One row per order, with columns id, customer_id, total_amount, and customer_dense_rank. Sorted by customer_id ascending, then total_amount descending.
Schema · ecommerce 5 tables
categories
id integer
name text
parent_id? integer
products
id integer
name text
category_id integer
price numeric
stock_qty integer
attributes? jsonb
order_items
id integer
order_id integer
product_id integer
quantity integer
unit_price numeric
customers
id integer
name text
email text
city? text
country text
created_at timestamptz
is_active boolean
orders
id integer
customer_id integer
ordered_at timestamptz
status text
total_amount numeric

Run previews · Check grades

Write a query, then run it to see results here.

Worked solution Try it yourself first
Solution query
SELECT
  id,
  customer_id,
  total_amount,
  DENSE_RANK() OVER (
    PARTITION BY
      customer_id
    ORDER BY
      total_amount DESC
  ) AS customer_dense_rank
FROM
  orders
ORDER BY
  customer_id,
  total_amount DESC

The shape

DENSE_RANK() OVER (PARTITION BY customer_id ORDER BY total_amount DESC) ranks each customer's orders by amount with no gaps after ties, restarting at 1 for every customer. The outer ORDER BY customer_id, total_amount DESC controls how the rows print but has no effect on the rank values themselves.

Clause by clause

  • SELECT id, customer_id, total_amount, DENSE_RANK() OVER (PARTITION BY customer_id ORDER BY total_amount DESC) AS customer_dense_rank returns each order's identifying columns and a per-customer dense rank. PARTITION BY customer_id makes each customer their own window; ORDER BY total_amount DESC sorts inside each window from largest to smallest order; DENSE_RANK assigns 1 to a customer's biggest order (or orders, if tied) and consecutive integers to each next-distinct amount.
  • FROM orders reads every order.
  • ORDER BY customer_id, total_amount DESC sorts the printed result set so each customer's orders appear together and within a customer they read from biggest to smallest. This is the query's outer sort, not the window's, and the two run independently.

Why DENSE_RANK over RANK here

The choice maps to what the consumer reads off the column. DENSE_RANK returns consecutive integers across distinct amounts, so customer rank 2 means "this customer's second-tier order amount." RANK would leave gaps after ties, which makes the column harder to read as a within-customer tier indicator. On tie-free data the two functions agree; the divergence shows up only on customers whose orders include duplicate amounts, where DENSE_RANK keeps the integers tight.

The trap

The outer ORDER BY and the window's ORDER BY look like they might interact, and they do not. The window function is fully computed before the outer ORDER BY runs; the ranks are determined entirely by what is inside OVER (...). Reordering or removing the outer sort changes only the row order in the output, not a single rank value. The mistake is reading the outer sort as participating in the ranking definition. It does not. If a customer's biggest order needs to appear first in the output, the outer sort is what does that work; if it needs to be ranked 1, the window's ORDER BY is what does that work.

You practiced DENSE_RANK() OVER (PARTITION BY ... ORDER BY ...) — gap-free per-partition ranking, the right shape when 'rank within group' should produce continuous integers regardless of ties.

How you actually get good at SQL

Reading explains SQL. Writing it, over and over with instant feedback, is what makes you fluent.

That's the whole SQLMaxx loop: 600+ real problems, instant AI feedback, mastery you can actually see, and spaced review that won't let you forget.

A stack of SQL practice problem cards, the top card showing an employees table.
615 problems · 66 concepts

Real problems. Not toy examples.

615 hand-built problems spanning all 66 concepts, from basic SELECTs to window functions, built on real schemas and real business questions, the kind you'll actually get asked on the job. Enough reps to make SQL automatic.

A retro computer showing a SQL query marked correct with a green checkmark.
Instant AI feedback

Write a query. Know if it's right in one second.

No copying an answer and hoping it clicked. The AI grader checks your real query against real data, catches exactly what's wrong, and explains the fix in plain English, like a senior analyst reading over your shoulder on every problem.

A circular mastery progress dial filling from blue to green, the SQLMaxx diamond at its center.
Mastery tracking

Stop guessing whether you actually know it.

SQLMaxx tracks every concept and shows you what you've mastered and what's still shaky. Your skills fill in one concept at a time, so 'I think I get joins' becomes something you can prove.

A SQL query editor circled by a blue return arrow with a clock, scheduled to come back for review.
Spaced review

Learn it once. Keep it for good.

Most of what you learn this week fades by next week. So when a concept comes due for review, SQLMaxx hands you a fresh problem to solve from a blank editor, not a flashcard to re-read. A research-backed spaced-repetition algorithm (FSRS) times each return for right before you'd forget, so your SQL is still there months later, when the interview or the job actually needs it.

Practice, feedback, mastery, review. That's the loop that turns reading into real skill.

Start free

No account, no credit card. Start solving in under a minute.