SQL: Department Highest Salary (LeetCode 184)

MediumDatabases

Description

> This problem is paper-only - see explanation for the canonical SQL solution. (LeetCode 184 classic.) Given `Employee(id, name, salary, department_id)` and `Department(id, name)`, return one row per department containing the highest-paid employee. If multiple employees tie for the top in a department, include all of them. **For the auto-grader:** return `[{ department, employee, salary }]` sorted by department ascending, employee ascending.

Example 1

Input: employees = [{id:1,name:"Joe",salary:90000,department_id:1},{id:2,name:"Jim",salary:90000,department_id:1},{id:3,name:"Henry",salary:80000,department_id:2}], departments = [{id:1,name:"IT"},{id:2,name:"Sales"}]

Output: [{department:"IT",employee:"Jim",salary:90000},{department:"IT",employee:"Joe",salary:90000},{department:"Sales",employee:"Henry",salary:80000}]

Constraints

- 0 <= employees.length, departments.length <= 10^4

Loading editor...