Sliding Windowhard70 minSoftware Engineer

Tickets Streaming Window Anomaly

Name: ProdMatch.ai
Availability: InStock

Software Engineer signal: sliding window + frequency map in a support ticket routing context. This is a ProdMatch-owned software engineer drill, framed as a April 2026 Lenskart Service Desk simulation, not a copied platform question.

Company context

Lenskart · Service Desk

Freshness

April 2026

Product surface

support ticket routing

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

Question

For support ticket routing, process a timestamp-ordered stream of tickets. 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

invariants
API correctness
graph modelling
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

Workflow Streaming Window Anomalyhard Search Streaming Window Anomalyhard Checkout Streaming Window Anomalyhard