Find Peak Calling Hours for Each City — LeetCode 2984 Python Solution
MediumLeetCode PremiumDatabase
- Problem
- #2984
- Reading time
- 5 min
- Source
- leetcode.com
Table schema
SQL
Table: Calls +--------------+----------+ | Column Name | Type | +--------------+----------+ | caller_id | int | | recipient_id | int | | call_time | datetime | | city | varchar | +--------------+----------+ (caller_id, recipient_id, call_time) is the primary key (combination of columns with unique values) for this table. Each row contains caller id, recipient id, call time, and city.Example
SQL
+--------------+----------+
| Column Name | Type |
+--------------+----------+
| caller_id | int |
| recipient_id | int |
| call_time | datetime |
| city | varchar |
+--------------+----------+
(caller_id, recipient_id, call_time) is the primary key (combination of columns with unique values) for this table.
Each row contains caller id, recipient id, call time, and city.Python solution
Python
import duckdb
import pandas as pd
def solution(calls: pd.DataFrame) -> pd.DataFrame:
con = duckdb.connect()
con.register("Calls", calls)
return con.execute("""WITH
T AS (
SELECT
*,
RANK() OVER (
PARTITION BY city
ORDER BY cnt DESC
) AS rk
FROM
(
SELECT
city,
HOUR(call_time) AS h,
COUNT(1) AS cnt
FROM Calls
GROUP BY 1, 2
) AS t
)
SELECT city, h AS peak_calling_hour, cnt AS number_of_calls
FROM T
WHERE rk = 1
ORDER BY 2 DESC, 1 DESC;""").df()Complexity
| Measure | Complexity |
|---|---|
| Time | O(n log n) (typical) |
| Space | O(n) auxiliary |
Related problems
Frequently asked questions
- How hard is LeetCode 2984. Find Peak Calling Hours for Each City?
- LeetCode 2984. Find Peak Calling Hours for Each City is rated Medium on LeetCode.
- What topics does LeetCode 2984. Find Peak Calling Hours for Each City cover?
- LeetCode 2984. Find Peak Calling Hours for Each City is tagged Database on LeetCode.
- Is LeetCode 2984. Find Peak Calling Hours for Each City a premium problem?
- Yes. LeetCode 2984. Find Peak Calling Hours for Each City is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.