Most Frequent Consecutive Website Pattern
Problem statement
You are given three equal-length arrays describing website visits. Entry i contains a username, an integer timestamp, and a website.
For each user, sort visits by timestamp; when timestamps are equal, keep their original input order. Every three adjacent visits in that per-user order form a consecutive website pattern. A user contributes at most once to the count of any distinct pattern, even if that pattern occurs several times for the user.
Examples
Example 1
usernames = ["amy","amy","amy","ben","ben","ben"]timestamps = [1,2,3,1,2,3]websites = ["home","cart","pay","home","cart","pay"]return = ["home","cart","pay"]Both users have the consecutive pattern [home, cart, pay], so it has two distinct-user supporters.
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
$99 billed yearly — or $19 month-to-month. Cancel anytime.