Find Cutoff Score for Each School — LeetCode 1988 Python Solution

MediumLeetCode PremiumDatabase
Problem
#1988
Reading time
2 min

Table schema

SQL
Table: Schools +-------------+------+ | Column Name | Type | +-------------+------+ | school_id | int | | capacity | int | +-------------+------+ school_id is the column with unique values for this table. This table contains information about the capacity of some schools.

Example

SQL
+-------------+------+
| Column Name | Type |
+-------------+------+
| school_id   | int  |
| capacity    | int  |
+-------------+------+
school_id is the column with unique values for this table.
This table contains information about the capacity of some schools. The capacity is the maximum number of students the school can accept.

Python solution

Python
import duckdb
import pandas as pd

def solution(schools: pd.DataFrame, exam: pd.DataFrame) -> pd.DataFrame:
    con = duckdb.connect()
    con.register("Schools", schools)
    con.register("Exam", exam)
    return con.execute("""SELECT school_id, MIN(IFNULL(score, -1)) AS score
FROM
    Schools AS s
    LEFT JOIN Exam AS e ON s.capacity >= e.student_count
GROUP BY school_id;""").df()

Complexity

MeasureComplexity
TimeO(n log n) (typical)
SpaceO(n) auxiliary

Related problems

Frequently asked questions

How hard is LeetCode 1988. Find Cutoff Score for Each School?
LeetCode 1988. Find Cutoff Score for Each School is rated Medium on LeetCode.
What topics does LeetCode 1988. Find Cutoff Score for Each School cover?
LeetCode 1988. Find Cutoff Score for Each School is tagged Database on LeetCode.
Is LeetCode 1988. Find Cutoff Score for Each School a premium problem?
Yes. LeetCode 1988. Find Cutoff Score for Each School is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity — invisible to screen sharing.

Get Stealth Interview