Find Pairs of Employees in the Same Department
Return every pair of employees who work in the same 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 pairs of employees in same department.
A correct answer returns 683 rows with 2 columns: first_name, first_name.
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
| first_name | first_name |
|---|---|
First 5 of 683 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
- Choosing exactly which columns a query returns
- Combining rows from two tables on a matching key with an inner join
- Joining a table to itself under two aliases
Hint and approach
Try the challenge first. Open these only when you need them.
Show the hint
Self join
Show the step-by-step approach
How the model solution is built, in the order the database evaluates it:
- Read from the
employeestable, under the aliase1. - Join
employeesagain, under the aliase2, one1.department=e2.department, and only wheree1.idis less thane2.id. - Return only the columns
e1.first_nameande2.first_name.
Model solution
Checking your session…
What to watch for
The condition e1.id < e2.id does two jobs: it stops an employee being paired with themselves and it keeps only one of (A, B) and (B, A). Using <> instead would list each pair twice.
- Self join. Without a condition such as a.id < b.id, a self join pairs every row with itself and lists each pair twice.
- INNER JOIN. An inner join drops rows that have no partner on the other side, and it repeats a row once for every match, which inflates SUM and COUNT.
Related SQL challenges
- List Employees with Their Manager Names Using a Self JoinSimilar levelMedium
- Join Three Tables: Orders, Users and PaymentsSimilar levelMedium
- Select Specific Columns from a TableEasierEasy
- Compare Each Employee's Salary with Their Manager'sHarderHard
- Find Managers Who Earn More Than All Their Direct ReportsHarderHard
Keep learning
- Lesson: SELF JOIN
- Lesson: INNER JOIN
- Lesson: The BIG 6 SQL Clauses
- All SQL practice challenges, by difficulty and topic
- SQL interview questions with answers
- SQL Playground: run any query on the same database