Search
⌘K

Leetcode 997. Find the Town Judge

Given directed trust relationships among n people, identify the person who is trusted by everyone else but trusts nobody — equivalently, find a node with in-degree n-1 and out-degree 0 in the directed graph, or return -1 if none exists.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.