MediumNo. 1709LeetCode Premium

Biggest Window Between Visits — LeetCode 1709 Python Solution

Topics
Database
Reading time
4 min

Table schema

SQLTable schema
Table: UserVisits +-------------+------+ | Column Name | Type | +-------------+------+ | user_id | int | | visit_date | date | +-------------+------+ This table does not have a primary key, it might contain duplicate rows. This table contains logs of the dates that users visited a certain retailer.

Example

SQLExample
+-------------+------+
| Column Name | Type |
+-------------+------+
| user_id     | int  |
| visit_date  | date |
+-------------+------+
This table does not have a primary key, it might contain duplicate rows.
This table contains logs of the dates that users visited a certain retailer.

Python solution

PythonSolution
import duckdb
import pandas as pd

def solution(user_visits: pd.DataFrame) -> pd.DataFrame:
    con = duckdb.connect()
    con.register("UserVisits", user_visits)
    return con.execute("""WITH
    T AS (
        SELECT
            user_id,
            DATEDIFF(
                LEAD(visit_date, 1, '2021-1-1') OVER (
                    PARTITION BY user_id
                    ORDER BY visit_date
                ),
                visit_date
            ) AS diff
        FROM UserVisits
    )
SELECT user_id, MAX(diff) AS biggest_window
FROM T
GROUP BY 1
ORDER BY 1;""").df()

Complexity

Time
O(n log n)(typical)
Space · auxiliary
O(n)

Related problems

Related problems
No.ProblemDifficulty
0175Combine Two TablesEasy
0176Second Highest SalaryMedium
0177Nth Highest SalaryMedium
0178Rank ScoresMedium
0180Consecutive NumbersMedium
0181Employees Earning More Than Their ManagersEasy

Frequently asked questions

How hard is LeetCode 1709. Biggest Window Between Visits?

LeetCode 1709. Biggest Window Between Visits is rated Medium on LeetCode.

What topics does LeetCode 1709. Biggest Window Between Visits cover?

LeetCode 1709. Biggest Window Between Visits is tagged Database on LeetCode.

Is LeetCode 1709. Biggest Window Between Visits a premium problem?

Yes. LeetCode 1709. Biggest Window Between Visits 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.

Free to download. Check it runs on your machine, then pick a plan.