In this guide, you will get 550. Game Play Analysis IV LeetCode Solution with the best time and space complexity. The solution to Game Play Analysis IV problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
+————–+———+
| 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.
Write a solution to report the fraction of players that logged in again on the day after the day they first logged in, rounded to 2 decimal places. In other words, you need to count the number of players that logged in for at least two consecutive days starting from their first login date, then divide that number by the total number of players.
The result format is in the following example.
550. Game Play Analysis IV LeetCode Solution in C++
WITH
Players AS (
SELECT player_id, MIN(event_date) AS first_login
FROM Activity
GROUP BY 1
)
SELECT ROUND(
COUNT(Players.player_id) / (
SELECT COUNT(DISTINCT Activity.player_id)
FROM Activity
),
) AS fraction
FROM Players
INNER JOIN Activity
ON (
Players.player_id = Activity.player_id
AND DATEDIFF(Players.first_login, Activity.event_date) = -1) /* code provided by PROGIEZ */
550. Game Play Analysis IV LeetCode Solution in Java
N/A // code provided by PROGIEZ
550. Game Play Analysis IV LeetCode Solution in Python
