How hard is LeetCode 1549. The Most Recent Orders for Each Product?

LeetCode 1549. The Most Recent Orders for Each Product is rated Medium on LeetCode.

What topics does LeetCode 1549. The Most Recent Orders for Each Product cover?

LeetCode 1549. The Most Recent Orders for Each Product is tagged Database on LeetCode.

Is LeetCode 1549. The Most Recent Orders for Each Product a premium problem?

Yes. LeetCode 1549. The Most Recent Orders for Each Product is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.

The Most Recent Orders for Each Product — LeetCode 1549 Python Solution

MediumLeetCode PremiumDatabase

Problem: #1549
Reading time: 4 min
Source: leetcode.com

Table schema

SQL

Table: Customers +---------------+---------+ | Column Name | Type | +---------------+---------+ | customer_id | int | | name | varchar | +---------------+---------+ customer_id is the column with unique values for this table. This table contains information about the customers.

Example

SQL

+---------------+---------+
| Column Name   | Type    |
+---------------+---------+
| customer_id   | int     |
| name          | varchar |
+---------------+---------+
customer_id is the column with unique values for this table.
This table contains information about the customers.

Python solution

Python

import duckdb
import pandas as pd

def solution(customers: pd.DataFrame, orders: pd.DataFrame, products: pd.DataFrame) -> pd.DataFrame:
    con = duckdb.connect()
    con.register("Customers", customers)
    con.register("Orders", orders)
    con.register("Products", products)
    return con.execute("""WITH
    T AS (
        SELECT
            *,
            RANK() OVER (
                PARTITION BY product_id
                ORDER BY order_date DESC
            ) AS rk
        FROM
            Orders
            JOIN Products USING (product_id)
    )
SELECT product_name, product_id, order_id, order_date
FROM T
WHERE rk = 1
ORDER BY 1, 2, 3;""").df()

Complexity

Measure	Complexity
Time	O(n log n) (typical)
Space	O(n) auxiliary

Frequently asked questions

How hard is LeetCode 1549. The Most Recent Orders for Each Product?: LeetCode 1549. The Most Recent Orders for Each Product is rated Medium on LeetCode.
What topics does LeetCode 1549. The Most Recent Orders for Each Product cover?: LeetCode 1549. The Most Recent Orders for Each Product is tagged Database on LeetCode.
Is LeetCode 1549. The Most Recent Orders for Each Product a premium problem?: Yes. LeetCode 1549. The Most Recent Orders for Each Product is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.