Town Judge - The Algorithm

I'll show you how to find the town judge using degree counting. The judge must be trusted by everyone, so in-degree equals $n-1$. The judge trusts nobody, so out-degree equals $0$.

You loop through all people and check if anyone satisfies both conditions. If yes, return that person. If no, return $-1$.

Time complexity: $O(n + t)$ where $t$ is the number of trust pairs. Space complexity: $O(n)$ for the degree arrays.