Search⌘ K
AI Features

Solution: Find the Town Judge

Explore how to find the town judge by applying graph theory concepts of indegree and outdegree to trust relationships. Learn to implement an algorithm that identifies the judge by checking who is trusted by everyone else but trusts no one, with efficient time and 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. ...