Search⌘ K
AI Features

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.

Statement

There are n people numbered from 11 to 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:

  1. The judge doesn’t trust anyone.

  2. Everyone else in the town (except the town judge) trusts the judge.

  3. 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 trust[i]=[ai,bi]trust[i] = [a_i, b_i] indicates that the person labeled aia_i ...