Customers with Maximum Number of Transactions on Consecutive Days (LeetCode 2752)
HardLeetCode 2752 · Top-N per group · 8:23· LeetCode PremiumLeetcode HARD 2752 - Customers with Maximum Transactions on Consecutive Days : Everyday Data ScienceMy notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 2752 Customers with Maximum Number of Transactions on Consecutive Days by Everyday Data Science: Window Functions, Hard. Topics: Database. Watch the explanation, then solve it on LeetCode.
- Difficulty
- hard
- Topics
- Database
- Patterns
- Top-N per group, Consecutive rows / gaps & islands
- Chapter
- Window Functions
- Duration
- 8:23
Related problems
- Consecutive Available Seats (LeetCode 603)
- Find the Start and End Number of Continuous Ranges (LeetCode 1285)
- The Most Frequently Ordered Products for Each Customer (LeetCode 1596)
- Maximum Transaction Each Day (LeetCode 1831)
- Highest Grade For Each Student (LeetCode 1112)
- The Most Recent Three Orders (LeetCode 1532)
- The Most Recent Orders for Each Product (LeetCode 1549)
- Get the Second Most Recent Activity (LeetCode 1369)