Find the Second Highest Salary in Each Department
Return the employees who earn the second-highest salary of their department.
The challenge runs on the SQLabHub practice database (SQLite) and uses the employees table. You can solve it in the browser, with nothing to install.
The task
Find employees with second highest salary in each department.
A correct answer returns 10 rows with 13 columns: id, first_name, last_name, email, department, department_id, title, salary, hire_date, manager_id, city, status, rnk.
Tables used in this challenge
employees 120 rows
id INTEGER (PK) · first_name TEXT · last_name TEXT · email TEXT · department TEXT · department_id INTEGER · title TEXT · salary REAL · hire_date TEXT · manager_id INTEGER · city TEXT · status TEXT
| id | first_name | last_name | department | department_id | title | salary | hire_date | manager_id | city | status | |
|---|---|---|---|---|---|---|---|---|---|---|---|
The first rows of each table are shown. See how all the tables relate on the database schema page.
Expected output
| id | first_name | last_name | department | department_id | title | salary | hire_date | manager_id | city | status | rnk | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
The complete result: 10 rows. This is the output of the model solution on the practice database. The task does not fix a sort order, so your rows may come back in a different order.
What you practise
- Filtering rows with a WHERE condition
- Querying the result of another query with a subquery in FROM
- Ranking rows with RANK() or DENSE_RANK() and handling ties
- Restarting a window calculation for each group with PARTITION BY
Hint and approach
Try the challenge first. Open these only when you need them.
Show the hint
DENSE_RANK
Show the step-by-step approach
How the model solution is built, in the order the database evaluates it:
- Build an inner query first (a derived table):
- Read from the
employeestable. - Rank the rows with
DENSE_RANK(), ordered bysalarydescending, restarting for eachdepartment. Tied rows share a rank and no rank number is skipped.
- Read from the
- Filter in
WHERE: keep the rows wherernkequals 2. The filter sits in the outer query because a window function cannot be tested in the WHERE clause of the query that computes it.
Model solution
Checking your session…
What to watch for
DENSE_RANK() = 2 picks the second salary level even when several people share the top one. A department with a single salary level returns nobody.
- RANK() and DENSE_RANK(). RANK() skips numbers after a tie (1, 1, 3) and DENSE_RANK() does not (1, 1, 2). Filtering on rank <= N returns more than N rows when there are ties.
- PARTITION BY. PARTITION BY is not GROUP BY: it keeps every row and only decides which rows a window function looks at.
- Derived table. Columns computed in the inner query are only visible outside under their alias, so every calculated column there needs a name.
Related SQL challenges
- Find the Top 2 Salaries in Each DepartmentSimilar levelHard
- Dense Rank Salaries Within Each DepartmentSimilar levelHard
- Find the Highest-Paid Employee in Each DepartmentEasierMedium
- Calculate the Median Salary per DepartmentSimilar levelHard
- Rank Products by Price Within Each CategorySimilar levelHard
Keep learning
- Lesson: RANK & DENSE_RANK
- Lesson: Window Functions
- Lesson: SQL Subqueries
- Lesson: WHERE Clause
- All SQL practice challenges, by difficulty and topic
- SQL interview questions with answers
- SQL Playground: run any query on the same database