Maximum Transaction Each Day — LeetCode 1831 Python Solution
MediumLeetCode PremiumDatabase
- Problem
- #1831
- Reading time
- 4 min
- Source
- leetcode.com
Table schema
SQL
Table: Transactions +----------------+----------+ | Column Name | Type | +----------------+----------+ | transaction_id | int | | day | datetime | | amount | int | +----------------+----------+ transaction_id is the column with unique values for this table. Each row contains information about one transaction.Example
SQL
+----------------+----------+
| Column Name | Type |
+----------------+----------+
| transaction_id | int |
| day | datetime |
| amount | int |
+----------------+----------+
transaction_id is the column with unique values for this table.
Each row contains information about one transaction.Python solution
Python
import duckdb
import pandas as pd
def solution(transactions: pd.DataFrame) -> pd.DataFrame:
con = duckdb.connect()
con.register("Transactions", transactions)
return con.execute("""WITH
T AS (
SELECT
transaction_id,
RANK() OVER (
PARTITION BY DAY(day)
ORDER BY amount DESC
) AS rk
FROM Transactions
)
SELECT transaction_id
FROM T
WHERE rk = 1
ORDER 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 1831. Maximum Transaction Each Day?
- LeetCode 1831. Maximum Transaction Each Day is rated Medium on LeetCode.
- What topics does LeetCode 1831. Maximum Transaction Each Day cover?
- LeetCode 1831. Maximum Transaction Each Day is tagged Database on LeetCode.
- Is LeetCode 1831. Maximum Transaction Each Day a premium problem?
- Yes. LeetCode 1831. Maximum Transaction Each Day is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.