Find the Town Judge Python Solution with Tests

lcpy gen -n 997   # by problem number
lcpy gen -s find_the_town_judge   # by problem name

Input: n = 2, trust = [[1,2]]
Output: 2

Input: n = 3, trust = [[1,3],[2,3]]
Output: 3

Input: n = 3, trust = [[1,3],[2,3],[3,1]]
Output: -1

class Solution:
    # Time: O(n + t) where t = len(trust)
    # Space: O(n)
    def find_judge(self, n: int, trust: list[list[int]]) -> int:
        # Net trust score: indegree - outdegree. Judge must reach n - 1.
        trust_score = [0] * (n + 1)
        for truster, trusted in trust:
            trust_score[truster] -= 1
            trust_score[trusted] += 1

        for person in range(1, n + 1):
            if trust_score[person] == n - 1:
                return person
        return -1