MediumNo. 1107LeetCode Premium

New Users Daily Count — LeetCode 1107 Python Solution

Topics
Database
Reading time
3 min

Table schema

SQLTable schema
Table: Traffic +---------------+---------+ | Column Name | Type | +---------------+---------+ | user_id | int | | activity | enum | | activity_date | date | +---------------+---------+ This table may have duplicate rows. The activity column is an ENUM (category) type of ('login', 'logout', 'jobs', 'groups', 'homepage').

Example

SQLExample
+---------------+---------+
| Column Name   | Type    |
+---------------+---------+
| user_id       | int     |
| activity      | enum    |
| activity_date | date    |
+---------------+---------+
This table may have duplicate rows.
The activity column is an ENUM (category) type of ('login', 'logout', 'jobs', 'groups', 'homepage').

Python solution

PythonSolution
import duckdb
import pandas as pd

def solution(traffic: pd.DataFrame) -> pd.DataFrame:
    con = duckdb.connect()
    con.register("Traffic", traffic)
    return con.execute("""WITH
    T AS (
        SELECT
            user_id,
            MIN(activity_date) OVER (PARTITION BY user_id) AS login_date
        FROM Traffic
        WHERE activity = 'login'
    )
SELECT login_date, COUNT(DISTINCT user_id) AS user_count
FROM T
WHERE DATEDIFF('2019-06-30', login_date) <= 90
GROUP 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 1107. New Users Daily Count?

LeetCode 1107. New Users Daily Count is rated Medium on LeetCode.

What topics does LeetCode 1107. New Users Daily Count cover?

LeetCode 1107. New Users Daily Count is tagged Database on LeetCode.

Is LeetCode 1107. New Users Daily Count a premium problem?

Yes. LeetCode 1107. New Users Daily Count 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.