Leetcode 2701. Consecutive Transactions with Increasing Amounts

Given a time-ordered list of transaction amounts, find the longest contiguous run (or count of runs) where each amount is strictly greater than the previous—possibly under extra constraints such as allowing a limited number of removals/adjustments or responding to multiple queries. This requires detecting and extending increasing contiguous segments efficiently using sliding-window/DP or monotonic techniques to meet tight time/space bounds.