// Runtime: 3 ms, faster than 95.16% of Java online submissions for Find the Town Judge.
// Memory Usage: 57.8 MB, less than 100.00% of Java online submissions for Find the Town Judge.
class Solution {
    public int findJudge(int N, int[][] trust) {
        if (trust.length < N - 1) return -1;

        int[] inDegree = new int[N];
        int[] outDegree = new int[N];

        for (int[] edge: trust) {
            int from = edge[0] - 1;
            int to = edge[1] - 1;

            outDegree[from] = outDegree[from] + 1;
            inDegree[to] = inDegree[to] + 1;
        }

        for (int i = 0; i < N; i++) {
            if (inDegree[i] == N - 1 && outDegree[i] == 0) {
                return i + 1;
            }
        }

        return -1;
    }
}