HardSQL challenge #251WINDOW FUNCTIONPARTITIONRANKING

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.

Solve This SQL Challenge

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

First 3 rows of the employees table
idfirst_namelast_nameemaildepartmentdepartment_idtitlesalaryhire_datemanager_idcitystatus
1WilliamLewiswlewis18@corp.ioCustomer Success7Senior CS Manager617742022-07-24NULLSan Diegoactive
2JohnMillerjmiller51@corp.ioLegal8Paralegal1916942021-08-09NULLSan Diegoactive
3DanielRiveradrivera50@corp.ioEngineering1VP Engineering1350672016-06-06NULLHoustonactive

The first rows of each table are shown. See how all the tables relate on the database schema page.

Expected output

Expected output of the challenge
idfirst_namelast_nameemaildepartmentdepartment_idtitlesalaryhire_datemanager_idcitystatusrnk
60MariaGarciamgarcia35@corp.ioCustomer Success7CS Manager1911202016-11-099Washington DCactive2
73JoshuaHalljhall66@corp.ioDesign10UI Designer1916572015-10-194San Franciscoactive2
49DorothyMartinezdmartinez19@corp.ioEngineering1Engineering Manager1956902021-04-215Philadelphiaactive2
65LindaMartinezlmartinez23@corp.ioFinance5Financial Analyst1946042015-07-143Philadelphiaactive2
102MichelleRodriguezmrodriguez67@corp.ioHR4HR Manager1721672020-04-222Jacksonvilleactive2
2JohnMillerjmiller51@corp.ioLegal8Paralegal1916942021-08-09NULLSan Diegoactive2
26MatthewWilsonmwilson27@corp.ioMarketing2CMO1965302015-10-033Columbusactive2
82JoshuaNguyenjnguyen7@corp.ioOperations6COO1826842023-05-064Austinactive2
118MichaelYoungmyoung35@corp.ioProduct9CPO1662882015-02-163Los Angelesactive2
57PaulThompsonpthompson52@corp.ioSales3Sales Manager1689802022-01-057Fort Worthactive2

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:

  1. Build an inner query first (a derived table):
    1. Read from the employees table.
    2. Rank the rows with DENSE_RANK(), ordered by salary descending, restarting for each department. Tied rows share a rank and no rank number is skipped.
  2. Filter in WHERE: keep the rows where rnk equals 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.
Solve This SQL Challenge

Keep learning