Search⌘ K
AI Features

Solution: Find the Town Judge

Understand how to determine the town judge by modeling trust as a graph problem. Explore the use of indegree and outdegree arrays to identify the unique person trusted by all but trusts none. This lesson guides you through the algorithm and its implementation, helping you solve related graph problems efficiently.

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