Search⌘ K
AI Features

Solution: Find the Town Judge

Explore how to determine the town judge by using graph concepts of indegree and outdegree. This lesson helps you apply these arrays to count trust relationships, identify a unique judge who is trusted by everyone but trusts no one, and understand the underlying algorithm for this problem. You will learn to implement an efficient solution with O(e) time complexity and O(n) space complexity.

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