Leetcode Problem 997. Find the Town Judge

997. Find the Town Judge

Leetcode Solutions

Initialize two arrays, indegrees and outdegrees, with a length of n + 1 to account for the 1-based indexing.
Iterate over the trust array, incrementing the outdegree of the trusting person and the indegree of the trusted person.
Iterate from 1 to n and check if there is a person with an indegree of n - 1 and an outdegree of 0.
If such a person is found, return their label as the town judge.
If no town judge is found, return -1.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen