Leetcode solving: 997. Find the Town Judge

Leetcode solving: 997. Find the Town Judge

Please subscribe to my channel

In a town, there are n people labelled from 1 to n. There is a rumor that one of these people is secretly the town judge.

If the town judge exists, then:

The town judge trusts nobody. Everybody (except for the town judge) trusts the town judge. There is exactly one person that satisfies properties 1 and 2. You are given trust, an array of pairs trust[i] = [a, b] representing that the person labelled a trusts the person labelled b.

If the town judge exists and can be identified, return the label of the town judge. Otherwise, return -1.

##############

My other Leetcode solving videos (easy)

https://www.youtube.com/playlist?list=PLg9w7tItBlZt4oUpNyWU_0rOItlScu1_d

Leetcode solving videos (Medium):

https://www.youtube.com/playlist?list=PLg9w7tItBlZvMGxy-y1eXURPD6Ao6kkzA

Leetcode solving videos (Hard):

https://www.youtube.com/playlist?list=PLg9w7tItBlZt4JQmlkGD3M5idZn14NyL6

############ ... https://www.youtube.com/watch?v=UYP2jmBjPJM