Challenge: Find the Celebrity

Statement

In a gathering of $N$ individuals (labeled from $0$ to $N-1$), there’s a possibility of one person being a celebrity. A celebrity is characterized by being known by everyone else and not knowing any attendees. This scenario is represented using an $N \times N$ binary $matrix$, where each cell contains either a $0$ or a $1$. If $matrix[i][j] = 1$, it signifies that person $i^{th}$ knows the $j^{th}$ person.

For the given $matrix$, determine the existence of a celebrity within the group. If a celebrity is identified, return its label, otherwise return $-1$.

Constraints:

• $N = matrix.length = matrix[i].length$
• $2 \leq N \leq 100$
• $matrix[i][j]$ is $0$ or $1$.

Examples