Search⌘ K
AI Features

Solution: Find the Town Judge

Discover how to determine the town judge by evaluating trust relationships in a town using graph theory concepts. Learn to use indegree and outdegree arrays to identify a person trusted by all but trusts no one. This lesson guides you through the algorithm's logic and its time and space complexity, helping you apply graph analysis to solve similar problems.

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