Search⌘ K
AI Features

Solution: Find the Town Judge

Explore the process of identifying the town judge by analyzing trust relationships as a graph problem. Understand how to use indegree and outdegree counts to locate the unique individual trusted by everyone and trusting no one, and implement an efficient algorithm to solve this common interview challenge.

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