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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.