Search⌘ K
AI Features

Solution: Find the Town Judge

Understand how to determine the town judge using graph theory by analyzing trust relationships. Learn to apply indegree and outdegree arrays to identify the unique person trusted by all and who trusts no one. This lesson covers the algorithm, complexity analysis, and practical coding implementation.

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 ...