How should I practice Longest Content Window with Bounded Labels?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Amazon phone screen problems in FastPrep.

Is Longest Content Window with Bounded Labels associated with Amazon?

FastPrep tags this as a Amazon phone screen coding practice problem when the problem catalog has that company and stage context.

Longest Content Window with Bounded Labels

Amazon● HardFULLTIMEPHONE SCREEN

Problem statement

A content stream arrives in order. Each item carries a non-empty set of labels. Given contentLabels and a limit k, find the longest contiguous window of items whose combined label set contains at most k distinct labels.

Return the inclusive zero-based endpoints [start, end]. If several windows have the same maximum length, return the one with the smallest start. Return [-1, -1] when the stream is empty. Labels within one item are unique.

The problem statement continues

Pro

Examples

Example 1

contentLabels = [["toxic","ok"],["toxic","ok","spam"]]k = 2return = [0,0]

The first item uses exactly two labels. Including the second item introduces spam, exceeding the limit.

FastPrep Pro

Reported in 1 Amazon interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week

See Amazon hiring insights