Search
⌘K

Leetcode 2752. Customers with Maximum Number of Transactions on Consecutive Days

Given transaction records (customer_id, transaction_date), determine which customer(s) have the largest number of transactions occurring within any sequence of consecutive calendar days — compute each customer's maximum transactions over consecutive-day streaks and return those tied for the global maximum. This requires grouping by customer/date, detecting consecutive-day runs (date arithmetic), and using sliding-window or window-function aggregation to compute streak totals efficiently.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.