Leetcode 1831. Maximum Transaction Each Day

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).