N056-M2 Tier 4 · Advanced · medium ecommerce · Brightlane

Return each customer's `customer_id`, calendar month, total spend in that month, and total spend in the immediately preceding month within that same customer's own order history

Part of Period-over-Period Analysis in SQL

The problem

Scenario: Brightlane's customer success team is monitoring how each individual customer's monthly spending shifts from one month to the next.

Task: Write a query to return each customer's customer_id, calendar month, total spend in that month, and total spend in the immediately preceding month within that same customer's own order history.

Assumptions:

  • A customer is present in a month only if they have at least one order placed in that month.
  • Each customer's prev_month_spend is drawn solely from that same customer's earlier order history.
  • The earliest month in each customer's own history has no preceding month within that customer; its prev_month_spend value is missing.

Output:

  • One row per (customer_id, month) pair present in the data.
  • Columns in this order: customer_id, month (the first day of the calendar month), monthly_spend, prev_month_spend.
  • Sorted by customer_id ascending, then month ascending.
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
  customer_id,
  DATE_TRUNC('month', ordered_at)::date AS MONTH,
  SUM(total_amount) AS monthly_spend,
  LAG(SUM(total_amount)) OVER (
    PARTITION BY
      customer_id
    ORDER BY
      DATE_TRUNC('month', ordered_at)
  ) AS prev_month_spend
FROM
  orders
GROUP BY
  customer_id,
  DATE_TRUNC('month', ordered_at)
ORDER BY
  customer_id,
  MONTH

The shape

Without PARTITION BY, LAG would walk across customer boundaries and pair one customer's first month with a different customer's last month. PARTITION BY customer_id isolates each customer's history into its own window, so the lookback stays inside the customer it belongs to.

Clause by clause

  • SELECT customer_id, DATE_TRUNC('month', ordered_at)::date AS month, SUM(total_amount) AS monthly_spend, LAG(SUM(total_amount)) OVER (PARTITION BY customer_id ORDER BY DATE_TRUNC('month', ordered_at)) AS prev_month_spend returns each customer's month bucket, that month's total spend, and the same customer's prior-month spend. PARTITION BY customer_id is what guarantees the lookback never leaks across customers; ORDER BY DATE_TRUNC('month', ordered_at) sets the chronological sequence inside each customer's partition.
  • FROM orders reads every order in the table.
  • GROUP BY customer_id, DATE_TRUNC('month', ordered_at) collapses the orders to one row per (customer, month) pair, which is the grain the window operates on.
  • ORDER BY customer_id, month prints each customer's history as a contiguous block, top to bottom in time order.

The trap

The window's PARTITION BY and ORDER BY are separate from the outer GROUP BY and outer ORDER BY, even though they reference some of the same columns. The window does its lookback on the already-grouped rows, partitioned and ordered as the OVER clause specifies. Dropping PARTITION BY customer_id from the window does not raise an error — it silently produces a query where the first row of customer B pulls customer A's last month as its "prior" value. The output looks normal, every number is a real number, and the report is wrong in a way no one will notice from the result alone.

You practiced partitioning LAG by customer_id so each customer's prior-month spend is drawn from their own history, never from another customer's row.

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.