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

Solution: Find the Town Judge

Explore how to solve the town judge problem by applying graph theory concepts in C++. Learn to use indegree and outdegree arrays to determine who is trusted by everyone but trusts no one, developing your ability to solve similar graph-based interview questions efficiently.

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