Solution: Find the Town Judge
Understand how to find the town judge by applying graph theory concepts such as indegree and outdegree. Learn to analyze trust relationships to determine the judge who is trusted by everyone but trusts no one. This lesson guides you through an efficient algorithm to solve this problem with clear explanations and complexity analysis.
We'll cover the following...
Statement
There are n people numbered from n in a town. There’s a rumor that one of these people is secretly the town judge. A town judge must meet the following conditions:
The judge doesn’t trust anyone.
Everyone else in the town (except the town judge) trusts the judge.
There is exactly one person who fulfills both the above conditions.
You are given an integer n and a two-dimensional array, trust, where each entry