N043-H1 Tier 4 · Advanced · hard ecommerce · Brightlane

Return every order's ID, customer ID, order amount, and the amount of that same customer's third order chronologically

Part of FIRST_VALUE, LAST_VALUE, NTH_VALUE in SQL

The problem

Brightlane's growth team tracks each customer's third purchase as a spending milestone. Every order should be annotated with the amount of that customer's third order — and where a customer has fewer than three orders on record, the third-order amount should be 0.00 rather than missing.

Write a query to return every order's ID, customer ID, order amount, and the amount of that same customer's third order chronologically.

Assumptions:

  • A customer's third order is the order with the third-smallest ordered_at for that customer_id, where position counting starts at 1. The same third-order amount appears on every row sharing a customer_id.
  • For customers who have placed fewer than three orders, the third-order amount column carries 0.00 on every row for that customer instead of a missing value.
  • The final result is sorted by customer_id ascending, then by ordered_at ascending.

Output:

  • One row per order, with columns id, customer_id, total_amount, and third_order_amount. Sorted by customer_id, then ordered_at.
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,
  COALESCE(
    NTH_VALUE(total_amount, 3) OVER (
      PARTITION BY
        customer_id
      ORDER BY
        ordered_at ROWS BETWEEN UNBOUNDED PRECEDING
        AND UNBOUNDED FOLLOWING
    ),
    0.00
  ) AS third_order_amount
FROM
  orders
ORDER BY
  customer_id,
  ordered_at

The shape

NTH_VALUE(total_amount, 3) returns the value of total_amount at position 3 of the partition, and the COALESCE substitutes 0.00 whenever that position does not exist. The explicit ROWS BETWEEN UNBOUNDED PRECEDING AND UNBOUNDED FOLLOWING frame lets every row in the partition see position 3, not only the rows from position 3 onward.

Clause by clause

SELECT id, customer_id, total_amount,
  COALESCE(
    NTH_VALUE(total_amount, 3) OVER (
      PARTITION BY customer_id ORDER BY ordered_at
      ROWS BETWEEN UNBOUNDED PRECEDING AND UNBOUNDED FOLLOWING
    ),
    0.00
  ) AS third_order_amount
FROM orders
ORDER BY customer_id, ordered_at
  • The window partitions each customer's orders, chronologically ordered, with a full-partition frame so position 3 is visible from row 1 onward.
  • NTH_VALUE(total_amount, 3) returns the total_amount at position 3, or NULL if the partition has fewer than three rows.
  • COALESCE(..., 0.00) replaces that NULL with 0.00 when a customer has fewer than three orders.
  • The outer ORDER BY controls display order.

Why COALESCE and not an NTH_VALUE default argument

LAG and LEAD accept a third argument that supplies a default when no row exists at the requested offset. NTH_VALUE does not. The function signature is NTH_VALUE(expression, n) only, with no slot for a fallback. The substitution has to happen outside the function call, which is what COALESCE is for. COALESCE(NTH_VALUE(...), 0.00) reads each row's NTH_VALUE result and returns 0.00 when that result is NULL.

The trap

The frame matters and the COALESCE matters, and they handle different problems. Without the explicit UNBOUNDED FOLLOWING frame, NTH_VALUE(..., 3) returns NULL on the first two rows of every partition because position 3 is not in the running frame yet, even for customers with five or six orders. Without the COALESCE, the function returns NULL for every row of a customer with only one or two orders. The two protections are not interchangeable. The frame widens what NTH_VALUE can see; the COALESCE substitutes a value when there is genuinely nothing to see. A query missing the frame returns NULL on rows that should have a value; a query missing the COALESCE returns NULL on rows where the prompt wants 0.00. Both protections are needed.

You practiced wrapping NTH_VALUE in COALESCE — when a partition is shorter than the requested position, NTH_VALUE returns missing; the COALESCE substitutes a domain-appropriate fallback so downstream arithmetic stays unbroken.

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.