Straight forward union find
Code
# Code\n```python3 []\nclass Solution:\n    def friendRequests(self, n: int, restrictions: List[List[int]], requests: List[List[int]]) -> List[bool]:\n        p = [i for i in range(n)]\n        def find(x):\n            if x!=p[x]:\n                p[x] = find(p[x])\n            return p[x]\n        res = []\n        for u,v in requests:\n            pu,pv = sorted([find(u),find(v)])\n            possible = True\n            for a,b in restrictions:\n                pa,pb = sorted([find(a),find(b)])\n                if (pa,pb) in [(pu,pv),(pu,pu),(pv,pv)]:\n                    possible = False\n                    break\n            res.append(possible)\n            if possible: p[pv] = pu\n        return res\n```
['Union Find', 'Python3']