FACEBOOK - FIND THE CELEBRITY (LeetCode)
Find the Celebrity coding solution. One of Facebook's most commonly asked interview questions according to LeetCode.
Coding Interviews Find the Celebrity (LeetCode) question and explanation.
This interview question is commonly asked by the following companies: Facebook, Pinterest, and Microsoft.
Problem description: Suppose you are at a party with n people (labeled from 0 to n - 1) and among them, there may exist one celebrity. The definition of a celebrity is that all the other n - 1 people know him/her but he/she does not know any of them.
Now you want to find out who the celebrity is or verify that there is not one. The only thing you are allowed to do is to ask questions like: "Hi, A. Do you know B?" to get information of whether A knows B. You need to find out the celebrity (or verify there is not one) by asking as few questions as possible (in the asymptotic sense).
You are given a helper function bool knows(a, b) which tells you whether A knows B. Implement a function int findCelebrity(n), your function should minimize the number of calls to knows.
Note: There will be exactly one celebrity if he/she is in the party. Return the celebrity's label if there is a celebrity in the party. If there is no celebrity, return -1.
Support me on Patreon: https://www.patreon.com/KevinNaughtonJr
Follow me on GitHub: https://github.com/kdn251
Follow me on Instagram: https://www.instagram.com/programeme
Видео FACEBOOK - FIND THE CELEBRITY (LeetCode) канала Kevin Naughton Jr.
Coding Interviews Find the Celebrity (LeetCode) question and explanation.
This interview question is commonly asked by the following companies: Facebook, Pinterest, and Microsoft.
Problem description: Suppose you are at a party with n people (labeled from 0 to n - 1) and among them, there may exist one celebrity. The definition of a celebrity is that all the other n - 1 people know him/her but he/she does not know any of them.
Now you want to find out who the celebrity is or verify that there is not one. The only thing you are allowed to do is to ask questions like: "Hi, A. Do you know B?" to get information of whether A knows B. You need to find out the celebrity (or verify there is not one) by asking as few questions as possible (in the asymptotic sense).
You are given a helper function bool knows(a, b) which tells you whether A knows B. Implement a function int findCelebrity(n), your function should minimize the number of calls to knows.
Note: There will be exactly one celebrity if he/she is in the party. Return the celebrity's label if there is a celebrity in the party. If there is no celebrity, return -1.
Support me on Patreon: https://www.patreon.com/KevinNaughtonJr
Follow me on GitHub: https://github.com/kdn251
Follow me on Instagram: https://www.instagram.com/programeme
Видео FACEBOOK - FIND THE CELEBRITY (LeetCode) канала Kevin Naughton Jr.
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
LRU Cache - Twitch Interview Question - Leetcode 146Facebook Coding Interview Question | Leetcode 277 | Find the CelebrityCelebrity Problem | SolutionEMPLOYEE FREE TIME (Leetcode) - Code & WhiteboardThe Celebrity Problem | GeeksforGeeksRotate Image - Matrix - Leetcode 48AMAZON CODING INTERVIEW QUESTION - REORGANIZE STRINGFACEBOOK - MEETING ROOMS (LeetCode)Sort Colors - Quicksort Partition - Leetcode 75 - PythonAMAZON - BINARY TREE PATHS (LeetCode)Valid Parenthesis String - Leetcode 678 - PythonWhy Working in Tech Won't Make You Happy...Celebrity Problem || Amazon & Microsoft Interview || C++GOOGLE CODING INTERVIEW QUESTION - KTH LARGEST ELEMENT IN AN ARRAY (LeetCode)Bellman-Ford - Cheapest Flights within K Stops - Leetcode 787 - PythonFACEBOOK - VALID PALINDROME (LeetCode)GOOGLE - NEXT CLOSEST TIME (LeetCode)GOOGLE CODING INTERVIEW QUESTION - BAG OF TOKENS