Just wondering why no one has answered my previous coding ? I originally asked o
ID: 3885881 • Letter: J
Question
Just wondering why no one has answered my previous coding ? I originally asked on Thursday or Friday and the question asked for the most efficient code. I received code but the code did not using the most efficient algorithm. This problem at hand is commonly referred to as the "celebrity problem" in algorithms which they often ask in interviews . I know there is a worst case linear solution that is either 2n or 3n checks (comparisons)which is obviously more efficient than the n^2 comparisons of the answer I received this past Friday. I just can't figure out how to translate the solution to Python code. Please help! Just wondering why no one has answered my previous coding ? I originally asked on Thursday or Friday and the question asked for the most efficient code. I received code but the code did not using the most efficient algorithm. This problem at hand is commonly referred to as the "celebrity problem" in algorithms which they often ask in interviews . I know there is a worst case linear solution that is either 2n or 3n checks (comparisons)which is obviously more efficient than the n^2 comparisons of the answer I received this past Friday. I just can't figure out how to translate the solution to Python code. Please help!Explanation / Answer
**Python Code:
**Time to find the celebrity is O(n) time and O(1) extra space
**Total comparisons are 3(N-1)
**Output:
The celebrity id is 2
**Comment for any further queries
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.