Leetcode Problem 2076. Process Restricted Friend Requests

2076. Process Restricted Friend Requests

Leetcode Solutions

Initialize a Union-Find data structure with n elements, where each element is its own group.
For each restriction [xi, yi], add yi to the restricted set of xi and vice versa.
For each friend request [uj, vj], perform the following steps: a. Find the group representatives of uj and vj. b. Check if merging the groups of uj and vj would violate any restrictions. c. If no restrictions are violated, merge the groups and mark the request as successful. d. If a restriction is violated, mark the request as unsuccessful.
Return the array of request results.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen