Find the Town Judge

In a town of n people labeled from 1 to n, there is a rumor that one of them is the town judge.
The town judge must satisfy two conditions:
1. The judge trusts nobody.
2. Everybody else (except the judge) trusts the judge.
You are given an array trust where trust[i] = [a, b] means person a trusts person b.
Return the label of the town judge if one exists, otherwise return -1.
________________________________________
🧠 Approach
We can use in-degree and out-degree logic:
• If person a trusts person b:
o a has out-degree +1 (trusts someone)
o b has in-degree +1 (is trusted by someone)
The judge is the person who:
• Has in-degree = n - 1 (everyone trusts them)
• Has out-degree = 0 (trusts no one)