Practice Process Restricted Friend Requests
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given an integer n indicating the number of people in a network. Each person is labeled from 0 to n - 1. You are also given a 0-indexed 2D integer array restrictions, where restrictions[i] = [xi, yi] means that person xi and person yi cannot become friends, either directly or indirectly through other people. Initially, no one is friends with each other. You are given a list of friend requests as a 0-indexed 2D integer array requests, where requests[j] = [uj, vj] is a friend request between person uj and person vj. A friend request is successful if uj and vj can be friends. Each friend request is processed in the given order (i.e., requests[j] occurs before requests[j + 1]), and upon a successful request, uj and vj become direct friends for all future friend requests. Return a boolean array result, where each result[j] is true if the jth friend request is successful or false if it is not. Note: If uj and vj are already direct friends, the request is still successful.
Source: Process Restricted Friend Requests on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
n = 3, restrictions = [[0,1]], requests = [[0,2],[2,1]]
[true,false]
# Example 2
n = 3, restrictions = [[0,1]], requests = [[1,2],[0,2]]
[true,false]
# Example 3
n = 5, restrictions = [[0,1],[1,2],[2,3]], requests = [[0,4],[1,2],[3,1],[3,4]]
[true,false,true,false]
Constraints
Related LeetCode Problems
Practice more problems similar to Process Restricted Friend Requests.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.