def findJudge(self, n: int, trust: List[List[int]]) -> int:
        
        # Note:
        #   We represent trust as a graph where an edge a -> b means a trusts b.
        #   The town judge is the only node with In Degree of (n-1), meaning 
        #   everyone trusts them, and an Out Degree of 0, meaning they trust nobody.
        #   We can track this with a single net score per person instead of using
        #   separate in and out degree counters.
        #   for (a -> b) in trust:
        #       +1 to b's score for incoming trust edges
        #       -1 to a's score for outgoing trust edges
        #   The judge if they exist will have a score of (n-1)

        # Check:
        # Single person, no trust relationships possible or needed,
        # they will always be the judge
        if n == 1 and not trust:
            return 1
        
        # Trust array to track net trust score for each person
        # sc: O(n)
        trustScore = [0] * (n + 1)
        
        # Check every trust relationship and update the trust score accordingly
        #   +1 for every person who trusts i
        #   -1 for every person i trusts
        # tc: O(m)
        for a, b in trust:
            trustScore[a] -= 1
            trustScore[b] += 1
        
        # Check every final trust score to see if any person has a score of (n-1)
        # tc: O(n)
        for person in range(1, n + 1):
            if trustScore[person] == n - 1:
                return person
        
        # overall: tc O(n + m)
        # overall: sc O(n)
        return -1