N008-E2 Tier 1 · Foundations · easy ecommerce · Brightlane

Return the ID, name, and price of the 3 cheapest products

Part of LIMIT and OFFSET in SQL

The problem

Brightlane's promotions team is featuring entry-level products in the weekly newsletter and wants the three lowest-priced items.

Write a query to return the ID, name, and price of the 3 cheapest products.

Assumptions:

  • The products table contains every product in Brightlane's catalogue.
  • When two products share the same price, the product with the lower id takes priority.

Output:

  • One row per product, with columns id, name, and price, sorted by price ascending (and id ascending for ties), capped at 3 rows.
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,
  name,
  price
FROM
  products
ORDER BY
  price
LIMIT
  3

The shape

Sorting price ascending puts the cheapest products at the top of the result, and LIMIT 3 cuts the output at the three rows the promotions team needs for the newsletter.

Clause by clause

  • SELECT id, name, price picks the three columns the newsletter slot displays.
  • FROM products reads every product in the catalogue. The bottom-three filter happens via sort plus cap, not via a WHERE clause.
  • ORDER BY price sorts ascending by default — smallest first. Picture Frame 8x10 and HDMI Cable 2m both sit at 12.99; the tie resolves with id 60 ahead of id 49, matching the prompt's note that lower id takes priority.
  • LIMIT 3 caps the output at three rows. PostgreSQL completes the sort, hands back the first three, and stops.

Why this and not ORDER BY price DESC LIMIT 3

DESC would put the most expensive products at the top. That's the right shape for a "top three" query — the wrong shape here. "Cheapest" means smallest price first, which is what ascending order produces. The cap is the same; what flips between top-N and bottom-N is the direction of the sort, not the LIMIT.

You practiced combining ORDER BY ASC with LIMIT to fetch the bottom-N rows. The recurring shape: sort ascending so the smallest values surface first, then cap with LIMIT — the mirror image of "top N" via DESC + LIMIT.

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.