N048-M1 Tier 4 · Advanced · medium ecommerce · Brightlane

Return one row per order with at least one line item, showing the customer ID, customer name, order ID, and the count of line items in that order

Part of LATERAL Joins in SQL

The problem

Brightlane's fulfillment director wants to evaluate order complexity across the customer base.

Write a query to return one row per order with at least one line item, showing the customer ID, customer name, order ID, and the count of line items in that order.

Assumptions:

  • Each order's item count is the number of line items linked to that order. Orders with zero line items do not appear in the result, and customers with no qualifying orders also do not appear.

Output:

  • One row per order with at least one line item, with columns customer_id, name, order_id, and item_count.
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
  c.id AS customer_id,
  c.name,
  o_data.order_id,
  o_data.item_count
FROM
  customers c
  CROSS JOIN LATERAL (
    SELECT
      o.id AS order_id,
      COUNT(*) AS item_count
    FROM
      orders o
      JOIN order_items oi ON oi.order_id = o.id
    WHERE
      o.customer_id = c.id
    GROUP BY
      o.id
  ) o_data

The shape

The lateral runs per customer and groups that customer's orders, returning one row per qualifying order with its line-item count. Because the lateral returns multiple rows when a customer has multiple orders, the outer customer row is duplicated once per order, which is the per-order shape the fulfillment director asked for.

Clause by clause

  • SELECT c.id AS customer_id, c.name, o_data.order_id, o_data.item_count returns the customer's identity from the outer table and the per-order results from the lateral.
  • FROM customers c is the driving table; the lateral is evaluated once per customer row.
  • CROSS JOIN LATERAL ( ... ) o_data is the lateral subquery. Inside it, FROM orders o JOIN order_items oi ON oi.order_id = o.id pairs each of this customer's orders with its line items, WHERE o.customer_id = c.id is the correlated filter that scopes the join to the outer customer, GROUP BY o.id collapses to one row per order, and SELECT o.id AS order_id, COUNT(*) AS item_count returns the count of items per order. Because the inner join drops orders with zero line items and the lateral inherits that, customers with no qualifying orders return zero rows and are dropped by the outer CROSS JOIN.

Why this and not a flat three-table join

FROM customers c JOIN orders o ON ... JOIN order_items oi ON ... GROUP BY c.id, c.name, o.id returns the same rows on this data and is a fine answer to this exact prompt. The lateral form is more direct because it expresses the question as it was asked: "for each customer, summarise each of their orders." When the per-order computation grows beyond a simple count (a per-order ORDER BY ... LIMIT over items, a per-order CASE rollup), the flat join needs a derived table to hold the per-order result; the lateral already has it.

The trap

The WHERE o.customer_id = c.id is what makes the subquery lateral. Drop it and PostgreSQL refuses to compile the query because the inner SELECT references c.id from a sibling FROM item, which is exactly the access LATERAL exists to grant. Every column inside the lateral that comes from the outer customer must be reachable through that correlated filter.

You practiced CROSS JOIN LATERAL over a multi-table inner query that aggregates per group — the lateral returns multiple rows (one per qualifying order) and drops outer records whose lateral set is empty.

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.