Search⌘ K
AI Features

Solution: Find the Town Judge

Explore how to determine the town judge by applying graph theory concepts of indegree and outdegree. Understand the criteria that define the judge and implement the algorithm to find the judge or return -1 if none exists. This lesson covers efficient traversal of trust data to solve the problem using fundamental graph analysis techniques.

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