Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Go

Solution: Find the Town Judge

Understand how to identify the town judge by leveraging graph theory concepts such as indegree and outdegree. This lesson guides you through detecting a unique individual trusted by all but who trusts no one, applying efficient graph traversal techniques and complexity analysis.

We'll cover the following...

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