Leetcode 2922. Market Analysis III

Given a sequence of daily market prices, determine for each day whether a future day within a fixed window meets a specified price condition (e.g., a sufficiently lower price), requiring efficient sliding-window checks. Solve using sliding-window data structures (monotonic queue or balanced BST) to avoid O(n*k) scans.