Search⌘ K
AI Features

Solution: Find the Town Judge

Understand how to solve the town judge problem by modeling trust relationships as a graph. Learn to use indegree and outdegree arrays to find the person trusted by all but trusts no one. This lesson covers the algorithm, its implementation, and complexity analysis to help you apply graph concepts effectively in coding interviews.

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