Game Play Analysis V — LeetCode 1097 Python Solution
HardLeetCode PremiumDatabase
- Problem
- #1097
- Reading time
- 4 min
- Source
- leetcode.com
Table schema
SQL
Table: Activity +--------------+---------+ | Column Name | Type | +--------------+---------+ | player_id | int | | device_id | int | | event_date | date | | games_played | int | +--------------+---------+ (player_id, event_date) is the primary key (combination of columns with unique values) of this table. This table shows the activity of players of some games.Example
SQL
+--------------+---------+
| Column Name | Type |
+--------------+---------+
| player_id | int |
| device_id | int |
| event_date | date |
| games_played | int |
+--------------+---------+
(player_id, event_date) is the primary key (combination of columns with unique values) of this table.
This table shows the activity of players of some games.
Each row is a record of a player who logged in and played a number of games (possibly 0) before logging out on someday using some device.Python solution
Python
import duckdb
import pandas as pd
def solution(activity: pd.DataFrame) -> pd.DataFrame:
con = duckdb.connect()
con.register("Activity", activity)
return con.execute("""WITH
T AS (
SELECT
player_id,
event_date,
MIN(event_date) OVER (PARTITION BY player_id) AS install_dt
FROM Activity
)
SELECT
install_dt,
COUNT(DISTINCT player_id) AS installs,
ROUND(
SUM(DATEDIFF(event_date, install_dt) = 1) / COUNT(DISTINCT player_id),
2
) AS day1_retention
FROM T
GROUP BY 1;""").df()Complexity
| Measure | Complexity |
|---|---|
| Time | O(n log n) (typical) |
| Space | O(n) auxiliary |
Related problems
Frequently asked questions
- How hard is LeetCode 1097. Game Play Analysis V?
- LeetCode 1097. Game Play Analysis V is rated Hard on LeetCode.
- What topics does LeetCode 1097. Game Play Analysis V cover?
- LeetCode 1097. Game Play Analysis V is tagged Database on LeetCode.
- Is LeetCode 1097. Game Play Analysis V a premium problem?
- Yes. LeetCode 1097. Game Play Analysis V is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.