N008-E3 Tier 1 · Foundations · easy hr · Helix Systems

Return the ID, name, and hire date of the 4 most recently hired employees

Part of LIMIT and OFFSET in SQL

The problem

Helix Systems' HR team is preparing a briefing for a new executive who wants to understand the most recent additions to the team.

Write a query to return the ID, name, and hire date of the 4 most recently hired employees.

Assumptions:

  • The employees table contains every active and former employee at Helix Systems.
  • When two employees share a hire_date, the employee with the lower id should appear first.

Output:

  • One row per employee, with columns id, name, and hire_date, sorted by hire_date descending (and id ascending for ties), capped at 4 rows.
Schema · hr 4 tables
departments
id integer
name text
location text
budget numeric
salaries
id integer
employee_id integer
amount numeric
effective_date date
end_date? date
employees
id integer
name text
email text
department_id integer
manager_id? integer
hire_date date
title text
is_active boolean
job_history
id integer
employee_id integer
title text
department_id integer
start_date date
end_date? date

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,
  hire_date
FROM
  employees
ORDER BY
  hire_date DESC
LIMIT
  4

The shape

Sorting hire_date descending puts the most recent hires at the top of the result, and LIMIT 4 cuts the output at the four rows the new executive's briefing needs.

Clause by clause

  • SELECT id, name, hire_date picks the three columns the briefing displays. Other employee fields stay out of the result.
  • FROM employees reads every active and former employee on file at Helix Systems. The recency cut happens after the sort, not as a WHERE filter.
  • ORDER BY hire_date DESC sorts so the latest hire_date lands first. Casey Davis on 2022-09-01 takes the top row; the four most recent hires fall into the first four positions.
  • LIMIT 4 caps the output at four rows. PostgreSQL completes the sort, hands back the first four, and stops.

Why descending matters here

Without DESC, ORDER BY hire_date sorts ascending — earliest hires first. That would surface the four employees who joined longest ago, the opposite of what the briefing asks for. The direction of the sort is what turns "four employees" into "the four most recently hired employees," and the LIMIT is what cuts the result to briefing size.

You practiced sorting by date descending and capping the result with LIMIT. "The N most recent ..." is the everyday shape of a recency feed; the deterministic tiebreaker is what guarantees the same N rows come back run after run.

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.