Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2092. Find All People With Secret
Given timestamped pairwise meetings and that person 0 initially shares a secret with firstPerson at time 0, determine who knows the secret after all meetings, where meetings at the same time allow instantaneous multi-hop sharing. The core challenge is to process meetings in time order and, for each timestamp, propagate the secret across the subgraph of simultaneous attendees (e.g., via union-find or BFS) to account for chained transmissions.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.