Find the Town Judge
Google● EasyINTERNONSITE INTERVIEWProblem statement
There are n people labeled from 1 through n. Each row trust[i] = [a, b] means that person a trusts person b.
A person is the town judge when both conditions hold:
- The person trusts nobody.
- Every other person trusts that person.
Return the judge's label. Return -1 when no person satisfies both conditions. When n = 1 and there are no trust relationships, person 1 is the judge.
The problem statement continues
ProExamples
Example 1
n = 2trust = [[1,2]]return = 2Person 2 trusts nobody and is trusted by the only other person.
FastPrep Pro
Reported in 1 Google interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 3 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week