N025-H2 Tier 2 · Core SQL · hard ecommerce · Brightlane

Return the name and price of every premium product

Part of Subqueries in WHERE (IN, EXISTS, ANY, ALL) in SQL

The problem

Brightlane's pricing team maintains a reference price list in category 999. A product is classified as premium if its price exceeds every item in that reference list.

Write a query to return the name and price of every premium product.

Assumptions:

  • The products table contains every product in the catalogue.
  • Category 999 is currently empty — no products have category_id = 999, so the reference price list is an empty set.
  • The result will contain every product in the catalogue. (When the reference list later has prices in it, the same query naturally returns only the products that beat all of them.)

Output:

  • One row per qualifying product, with columns name and price. The result will contain all 63 products in the catalogue.
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
  name,
  price
FROM
  products
WHERE
  price > ALL (
    SELECT
      price
    FROM
      products
    WHERE
      category_id = 999
  )

The shape

> ALL is true only when the comparison holds for every value in the subquery's result. When the subquery returns no values, "every value" is vacuously satisfied. There's nothing to fail against, so the test returns true for every outer row. Category 999 is empty, so the reference list is empty, so every product in the catalogue clears the bar.

Clause by clause

  • SELECT name, price FROM products reads every product. The filter keeps only the ones whose price beats every value in the reference list.
  • SELECT price FROM products WHERE category_id = 999 is the inner subquery. It collects every price from products tagged to category 999. With no products in that category, the subquery returns the empty set.
  • WHERE price > ALL (...) is the outer test. For each product, PostgreSQL asks: is this price greater than every value in the inner set? When the inner set is empty, there is no value the outer price can fail against, so the test returns true for every row. All 63 catalogue products come through.

Why this and not > (SELECT MAX(price) ...)

The natural first instinct is to write the test as WHERE price > (SELECT MAX(price) FROM products WHERE category_id = 999). It reads more directly: a premium product is one whose price exceeds the highest reference price. On a populated reference list, the two forms return the same products.

They diverge when the reference list is empty. MAX over an empty set returns NULL, and price > NULL is NULL for every row, so the scalar-subquery form would silently return zero rows. > ALL returns true for every row in the same situation. Same business question, opposite answers on empty input.

The trap

The trap is reading "every product passes" as a query bug. It isn't. The empty subquery is the reason, and > ALL is defined to return true on the vacuous case. The behaviour is useful when the reference set might genuinely be empty in production. It's surprising when the empty set was unintentional — a typo on category_id, a misnamed filter, an upstream load that didn't run.

The mirror image: > ANY against an empty subquery returns false for every row. When an ALL filter returns the whole table or an ANY filter returns nothing, check the inner subquery first.

You practiced > ALL against an empty subquery. Useful to know when a reference set might genuinely be empty in production; surprising when it's empty by accident.

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.