Day 10 of 31-Day May LeetCode Challenge
In a town, there are
N people labelled from
N. There is a rumor that one of these people is secretly the town judge.
If the town judge exists, then:
- The town judge trusts nobody.
- Everybody (except for the town judge) trusts the town judge.
- There is exactly one person that satisfies properties 1 and 2.
You are given
trust, an array of pairs
trust[i] = [a, b] representing that the person labelled
a trusts the person labelled
If the town judge exists and can be identified, return the label of the town judge. Otherwise, return