Sliding Windowhard70 minMobile Engineer

DeepLink Streaming Window Anomaly

Mobile Engineer signal: sliding window + frequency map in a deep-link resolver context. This is a ProdMatch-owned mobile engineer drill, framed as a April 2026 Adobe Growth Mobile simulation, not a copied platform question.

Company context

Adobe · Growth Mobile

Freshness

April 2026

Product surface

deep-link resolver

ProdMatch interview simulation based on product-team patterns; not a claim of a real company question.

Question

For deep-link resolver, process a timestamp-ordered stream of routes. Find the longest contiguous window where at most k distinct risk labels appear and the total severity stays under budget.

Input

Array of events {label, severity} and integers k, budget.

Output

Maximum window length satisfying both constraints.

Constraints

1 <= events.length <= 300000
1 <= k <= 50
Severity values are positive integers.

Concepts

offline sync
local cache
gesture streams
sliding window
frequency map
stream processing

labels: A,B,A,C with k=2 and budget=7 -> longest valid window length is 3

Approach

Try framing your own approach first. The 30 seconds you think before peeking is where learning happens.

Clean Solution

Reveal the approach first.

How well did you understand?

Your rating tunes when this problem shows up again.

Common Mistakes

Update the answer only after the window is valid.
Avoid recomputing the whole window on every move.

Next Similar Problems

Sync Streaming Window Anomalyhard Feed Streaming Window Anomalyhard Cache Streaming Window Anomalyhard