Available question text
Given a list of time-stamped transactions, produce for each day the maximum transaction amount occurring that day (or, if a window length is specified, the maximum within the last k days for each day). The core challenge is efficient grouping/aggregation and maintaining windowed maxima over large inputs (patterns: hash grouping + sweep, or sliding-window max using a deque/heap).
Related questions
Continue with questions that share topics or the same question type.
- The First Day of the Maximum Recorded Degree in Each City
Coding
- Amount of New Area Painted Each Day
Coding
- Given an array nums and a sliding window of size k moving from the very left to the very right, return the maximum value in the window for each position. Solve in O(n) time using a deque.
Coding
- Maximal Range That Each Element Is Maximum in It
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1831. Maximum Transaction Each Day
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source