Search⌘ K

Solution: Find the Celebrity

Explore how to find a celebrity in a gathering by using a stack data structure and a binary matrix representation. Understand the step-by-step method to narrow down and verify a celebrity based on who knows whom. This lesson teaches an efficient algorithm with O(N) time complexity, helping you prepare practical coding solutions for interviews.

We'll cover the following...

Statement

In a gathering of NN individuals (labeled from 00 to N1N-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×NN \times N binary matrixmatrix, where each cell contains either a 00 or a 11. If matrix[i][j]=1matrix[i][j] = 1, it signifies that person ithi^{th} knows the jthj^{th} person.

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