N026-H1 Tier 2 · Core SQL · hard ecommerce · Brightlane

Return the category ID and product count for every category that contains **at least three** products

Part of Derived Tables (Subqueries in FROM) in SQL

The problem

Brightlane's catalogue team is reviewing product groupings for quality control and needs to identify categories with meaningful product depth.

Write a query to return the category ID and product count for every category that contains at least three products.

Assumptions:

  • The products table contains every product in the catalogue.
  • The threshold (>= 3) applies to the per-category product count.
  • Some products have a missing category_id; if there are at least three such products, the result will include a row whose category_id is missing.

Output:

  • One row per qualifying group (including the missing-category_id group if it qualifies), with columns category_id and product_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
  category_id,
  product_count
FROM
  (
    SELECT
      category_id,
      COUNT(*) AS product_count
    FROM
      products
    GROUP BY
      category_id
  ) AS category_counts
WHERE
  product_count >= 3

The shape

The inner query groups every product row — including the ones with no category_id — and the outer query filters down to groups with at least three products. The NULL-category group survives the filter on the same terms as any other category and lands in the result with category_id shown as missing.

Clause by clause

  • The inner block counts products per category, without any pre-filter:
SELECT category_id, COUNT(*) AS product_count
FROM products
GROUP BY category_id

This is the part that quietly produces the NULL group. GROUP BY collapses every product whose category_id is NULL into a single bucket — NULL here is treated as one distinct grouping key, not as "no group." That bucket has its own count. - FROM (...) AS category_counts materialises the per-category counts. - WHERE product_count >= 3 keeps every group with three or more products. The threshold is on the count column, which is never NULL here — every group has a real, positive count regardless of whether its category_id is missing. - SELECT category_id, product_count returns each surviving group. The result includes ten rows; one of them carries category_id = NULL and product_count = 3, which represents three uncategorised products that, taken together, met the depth threshold.

The trap

GROUP BY treats NULL as a single grouping key. Every row with a NULL category collapses into one group, that group's count is computed alongside every other category's count, and the outer WHERE has no special handling for it. product_count >= 3 is true or false based on the count alone, with no awareness of whether the underlying category_id was real.

The consequence cuts both ways. If you want the NULL group out, you have to remove it explicitly — either with WHERE category_id IS NOT NULL inside the inner query (the M2 pattern), or with category_id IS NOT NULL added to the outer WHERE. If you don't, the NULL group shows up in the result like any other, and a report meant to list categories with three or more products silently includes a row whose category isn't a category at all.

You practiced an aggregate-then-filter pattern that includes the NULL group. The recurring rule: GROUP BY collapses all NULLs into one group — that group survives the outer filter on the same terms as any other category, which is sometimes desired and sometimes a surprise.

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.