Problem · Graph
Versioned Friend Recommendations
Problem statement
A directed social graph has n users numbered from 0 to n - 1. A relationship u -> v means that user u follows user v.
Process relationship updates, immutable snapshots, and historical recommendation queries. Every snapshot includes all earlier updates, and later updates never change an earlier snapshot.
The problem statement continues
ProExamples
Example 1
n = 5operations = ["FOLLOW 0 1","FOLLOW 0 2","FOLLOW 1 3","FOLLOW 2 3","FOLLOW 2 4","SNAPSHOT","RECOMMEND 0 0 2"]return = ["0","[3,4]"]User 3 has score 2 through middle users 1 and 2. User 4 has score 1 through user 2.
FastPrep Pro
Reported in 1 OpenAI 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
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$9/month
Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week