Leetcode #2072: The Winner University
In this guide, we solve Leetcode #2072 The Winner University in Python and focus on the core idea that makes the solution efficient.
You will see the intuition, the step-by-step method, and a clean Python implementation you can use in interviews.
Problem Statement
Table: NewYork +-------------+------+ | Column Name | Type | +-------------+------+ | student_id | int | | score | int | +-------------+------+ In SQL, student_id is the primary key for this table. Each row contains information about the score of one student from New York University in an exam.
Quick Facts
- Difficulty: Easy
- Premium: Yes
- Tags: Database
Intuition
The task is relational in nature, which maps cleanly to DataFrame operations in Python.
By treating tables as DataFrames, joins and group-bys become concise and readable.
Approach
Load the inputs as DataFrames and apply the appropriate merge, filter, or group-by.
Select or rename the columns to match the required output.
Steps:
- Load inputs as DataFrames.
- Apply merge/groupby/filter operations.
- Select the output columns.
Example
+-------------+------+
| Column Name | Type |
+-------------+------+
| student_id | int |
| score | int |
+-------------+------+
In SQL, student_id is the primary key for this table.
Each row contains information about the score of one student from New York University in an exam.
Python Solution
import duckdb
import pandas as pd
def solution(new_york: pd.DataFrame, california: pd.DataFrame) -> pd.DataFrame:
con = duckdb.connect()
con.register("NewYork", new_york)
con.register("California", california)
return con.execute("""SELECT
CASE
WHEN n1.cnt > n2.cnt THEN 'New York University'
WHEN n1.cnt < n2.cnt THEN 'California University'
ELSE 'No Winner'
END AS winner
FROM
(SELECT COUNT(1) AS cnt FROM NewYork WHERE score >= 90) AS n1,
(SELECT COUNT(1) AS cnt FROM California WHERE score >= 90) AS n2;""").df()
Complexity
The time complexity is O(n log n) (typical). The space complexity is O(n).
Edge Cases and Pitfalls
Watch for boundary values, empty inputs, and duplicate values where applicable. If the problem involves ordering or constraints, confirm the invariant is preserved at every step.
Summary
This Python solution focuses on the essential structure of the problem and keeps the implementation interview-friendly while meeting the constraints.