Citadel ASE OA 2026 | Order Book Liquidity & Portfolio Dependency Resolver

Problem 1 - Order Book Liquidity Problem Statement You are given an integer array prices, an integer k, and an integer m. A window of length k is considered Liquid if at least one price appears at least m times inside the window. Return the total number of liquid windows. Constraints Constraint 1 ≤ prices.length ≤ 105 1 ≤ k ≤ prices.length 1 ≤ m ≤ k Test Case Input Output prices = [1,2,1,3,1,2] k = 3 m = 2 ...