N046-M3 Tier 4 · Advanced · medium ecommerce · Brightlane

Return one row per customer-status pair on record, showing the customer ID, status, ID of the earliest order in that pair, when it was placed, and the order amount. Sort the final result by `customer_id` ascending, then `status` ascending

Part of DISTINCT ON in SQL

The problem

Brightlane's operations team wants to know when each customer first reached each order status — the first time a customer placed a delivered order, the first time a cancelled order, and so on.

Write a query to return one row per customer-status pair on record, showing the customer ID, status, ID of the earliest order in that pair, when it was placed, and the order amount. Sort the final result by customer_id ascending, then status ascending.

Assumptions:

  • For each customer-status pair, the earliest order is the order with the smallest ordered_at among that customer's orders carrying that status.
  • Each customer-status pair on record should appear once. Pairs with no orders on record do not appear.
  • The final result is sorted by customer_id ascending, then status ascending.

Output:

  • One row per customer-status pair on record, with columns customer_id, status, order_id, ordered_at, and total_amount. Sorted by customer_id, then status.
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 DISTINCT
  ON (customer_id, status) customer_id,
  status,
  id AS order_id,
  ordered_at,
  total_amount
FROM
  orders
ORDER BY
  customer_id,
  status,
  ordered_at

The shape

The deduplication key can be a tuple. DISTINCT ON (customer_id, status) keeps one row per unique combination of those two values, and ORDER BY customer_id, status, ordered_at (all ascending) picks the earliest order in each combination. A customer with five delivered and three cancelled orders contributes two rows: their earliest delivered order and their earliest cancelled order.

Clause by clause

  • SELECT DISTINCT ON (customer_id, status) customer_id, status, id AS order_id, ordered_at, total_amount returns the five columns the operations review needs. DISTINCT ON (customer_id, status) declares one row per distinct (customer_id, status) pair — a customer can appear multiple times in the result, once for each status they ever reached.
  • FROM orders reads the order records. Customers with no orders never enter this row source.
  • ORDER BY customer_id, status, ordered_at sorts the orders so that within each (customer_id, status) group, the oldest order sits first. The first two columns of the sort must match the DISTINCT ON expressions exactly, in the same order — that is how PostgreSQL is able to group duplicates and pick the first row from each group. The third sort key, ordered_at ascending, is the tiebreaker that picks the earliest order inside each group.

Why this and not ROW_NUMBER

The multi-key version is just PARTITION BY with two columns:

SELECT customer_id, status, order_id, ordered_at, total_amount
FROM (
  SELECT customer_id, status, id AS order_id, ordered_at, total_amount,
    ROW_NUMBER() OVER (PARTITION BY customer_id, status ORDER BY ordered_at) AS rn
  FROM orders
) ranked
WHERE rn = 1
ORDER BY customer_id, status

Both forms return one row per customer-status pair. The DISTINCT ON version scales naturally as more keys are added: list them in DISTINCT ON, list them in the leading positions of ORDER BY, done.

You practiced multi-key DISTINCT ON — list two keys; the per-group pick happens for each unique combination of those two values.

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.