Find Word-Multiset Windows
Problem statement
You are given a tokenized text textWords and a nonempty list targetWords. Return every word index at which a consecutive window contains exactly the same multiset of words as targetWords.
The problem statement continues
ProExamples
Example 1
textWords = ["red","blue","green","blue","red"]targetWords = ["blue","red"]return = [0,3]The first and last two-word windows each contain one red and one blue word.
Original screenshot from the interview report
ProFastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 1 more worked example, 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