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

Solution: Find the Town Judge

Explore how to find the town judge in a trust network by applying graph theory concepts. Understand how to use indegree and outdegree counts to determine the unique individual trusted by all and trusting none. This lesson equips you to implement an efficient algorithm that solves the problem with clear time and space 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. ...