Leetcodify Friends Recommendations — LeetCode 1917 Python Solution

HardLeetCode PremiumDatabase
Problem
#1917
Reading time
5 min

Table schema

SQL
Table: Listens +-------------+---------+ | Column Name | Type | +-------------+---------+ | user_id | int | | song_id | int | | day | date | +-------------+---------+ This table may contain duplicates (In other words, there is no primary key for this table in SQL). Each row of this table indicates that the user user_id listened to the song song_id on the day day.

Example

SQL
+-------------+---------+
| Column Name | Type    |
+-------------+---------+
| user_id     | int     |
| song_id     | int     |
| day         | date    |
+-------------+---------+
This table may contain duplicates (In other words, there is no primary key for this table in SQL).
Each row of this table indicates that the user user_id listened to the song song_id on the day day.

Python solution

Python
import duckdb
import pandas as pd

def solution(listens: pd.DataFrame, friendship: pd.DataFrame) -> pd.DataFrame:
    con = duckdb.connect()
    con.register("Listens", listens)
    con.register("Friendship", friendship)
    return con.execute("""WITH
    T AS (
        SELECT user1_id, user2_id FROM Friendship
        UNION
        SELECT user2_id AS user1_id, user1_id AS user2_id FROM Friendship
    )
SELECT DISTINCT l1.user_id, l2.user_id AS recommended_id
FROM
    Listens AS l1,
    Listens AS l2
WHERE
    l1.day = l2.day
    AND l1.song_id = l2.song_id
    AND l1.user_id != l2.user_id
    AND NOT EXISTS (
        SELECT 1
        FROM T AS t
        WHERE l1.user_id = t.user1_id AND l2.user_id = t.user2_id
    )
GROUP BY l1.day, l1.user_id, l2.user_id
HAVING COUNT(DISTINCT l1.song_id) >= 3;""").df()

Complexity

MeasureComplexity
TimeO(n log n) (typical)
SpaceO(n) auxiliary

Related problems

Frequently asked questions

How hard is LeetCode 1917. Leetcodify Friends Recommendations?
LeetCode 1917. Leetcodify Friends Recommendations is rated Hard on LeetCode.
What topics does LeetCode 1917. Leetcodify Friends Recommendations cover?
LeetCode 1917. Leetcodify Friends Recommendations is tagged Database on LeetCode.
Is LeetCode 1917. Leetcodify Friends Recommendations a premium problem?
Yes. LeetCode 1917. Leetcodify Friends Recommendations 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.

Get Stealth Interview