Available question text
Process a sequence of friend requests using a disjoint-set to maintain friend groups, accepting a request only if merging the two components would not put any restricted pair into the same component (restrictions apply transitively). The core challenge is efficiently checking these forbidden pairs before each union so you can return a boolean success array.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2076. Process Restricted Friend Requests
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source