Celebrity Problem | Solution

[@binitrajshah9354]

Sir you're potential candidate to be a celebrity for sure Thank you !

[@Elon-musk-007]

I never understood this question I had been just skipping this question . Thank you Sir... Keep up the good work ..... You will soon rise

[@Pepcoding]

Keep watching

[@yushsingla9905]

i still miss your videos sir. I know you're a lot busier now but i would love if you yourself could still make such amazing videos, I really appreciate your work and am sure it will help people for many years. Even though i use c++ still watch all your videos when stuck on a problem.

[@Pepcoding]

Working on it!

[@sachinsharma905]

Sumeet sir,hamesha ki tarah aap toh cha gaye. Kya hi explain kiya aapna. Thanks.

[@faizanhaider3953]

Gardaa.... Question kaa Dhajji Dhajjji ura sir aap to.... 🙏🙏

[@harshchandwani9781]

This question made me a fan of you, no one can explain it better than you

[@architsharma4331]

Sir this is my approach to do this Question in O(n):- public static void findCelebrity(int[][] arr) { Stack st=new Stack(); //this loop will find the rows having 0 in them and push them in stack for(int i=0;i

[@indranilchakraborty5949]

Thank you sir.... now I am just arrived in second year but still able to understand.

[@Pepcoding]

All the best. If you like the content, please share in your circles.

[@Live-hh6li]

Thanks again Nowadays KZbin recomend your videos on top to me Saves a lot of time in finding good solution.

[@Pepcoding]

Glad to hear that!

[@enigma2886]

kya teacher ha yein bhai saab ! dhanyawaad sir ji !

[@brijpatel237]

there's a reason why this video still doesn't have any dislikes, awesome quality and logic.

[@Pepcoding]

It's all because of the love and respect which you people have given to me. If you like our efforts, will you like to write a few words about us here (www.quora.com/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms ) Keep motivating, keep learning and keep loving Pepcoding😊

[@avinashchaurasiya6497]

After searching soo much I found that you are a celebrity.❤❤

[@Pepcoding]

Glad to know that you liked the content and thank you for appreciating. The love and respect which I get from you people keep me highly motivated and the same I am able to forward It to you people through my videos. So, keep motivating, keep learning and keep loving Pepcoding😊

[@gauravshukla5203]

your explaination is the best on internet..great sab kuch samjh a gaya itni asani se

[@Pepcoding]

thank you

[@piyushsarraf9994]

Sir, Bhagwan aapka bhala kare Mast samjhate hai ek hi baar me aa gya

[@Deepakkumar-kl6ni]

One day know you all according to your lacture We understand you by working very hard Thank you very much Sir

[@Pepcoding]

Thankyou beta! I am glad you liked it. If you like our efforts, will you like to write a few words about us here (www.quora.com/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms )

[@chitranshsaxena59]

I was always scared of this question, and today, I only saw the video till 6:14 and I was able to solve the question... His solutions are good...but his way of explaining any problem, that is insane

[@Pepcoding]

If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )

[@pranav288]

@@Pepcoding WTF ??

[@Pepcoding]

@@pranav288 Don't worry. We are soon to close the website, anyway. So it doesn't matter anymore.

[@pareshshikhaliya4702]

good work and very good explanation but this can be done with O(1) space complexity which increase student more chances to get selected bellow find the O(1) space and O(n) time complexity public class Solution extends Relation { public int findCelebrity(int n) { int candidate = 0; // First pass to find out the potential candidate for (int i = 1; i < n; i ++) { if (!knows(i, candidate)) { candidate = i; } } // Second pass to determine if that candidate is a celebrity for (int i = 0; i < n; i ++) { if (i != candidate) { if (!knows(i, candidate)) { return -1; } if (knows(candidate, i)) { return -1; } } } return candidate; } }

[@yogeshwarshendye4857]

Sir a slightly different approach: check all rows if any of item is 1 break the loop, this gave me the row that had all 0s and i kept that number in a stack. If stack size comes to be 0, there are no celebrity but otherwise, check for column of that number. If any one is 0, no celebrity, otherwise that number comes out to be the celebrity. This solution submitted and score 10. But I am not quite sure it it is the right way.

[@shrad6611]

shandaar jabardast jindabaad, hats off to you sumit sir

[@tekbssync5727]

bahut badhiya samjhaya aapne, ekdum crystal clear ❤

[@Pepcoding]

Thankyou beta! I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem. If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )

[@bishalchatterjee8184]

Pepcoding is the best!!!!!!!!!!!!!! Loved the explanation sir!

[@vyomyadav6497]

Sir just a tip, try to animate your content and get into the mind of youth, you are the most excellent teacher, you will do marvels.

[@Pepcoding]

Ji beta, sochte h iske bare main

[@Deepakkumar-kl6ni]

Sir apke samjane ka tarika bhot aacha hai 👍 ham specially for hindi medium student thanks sir aaap mahan ho

[@Pepcoding]

Thankyou beta! I am glad you liked it. I also hope that you are watching till the end and trying to understand the what, how, and especially why of the problem. If you like our efforts, will you like to review us here - g.page/Pepcoding/review?rc

[@MindsetMotivation75]

I understand the solution in just one flow . Thank you sir

[@FaisalKhan-ce2qu]

its great that you are making a separate video for implementation! a great help to new coders like me ! kudos !

[@Pepcoding]

Are you aware ki we have a portal as well, jahan question submit kar sakte hain www.pepcoding.com/resources/online-java-foundation

[@AyushKumar-fk5lm]

Could solve this only because of Sumeet Sir! Thank you sir!!🙏

[@Pepcoding]

Thankyou beta! I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem. If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )

[@AyushKumar-fk5lm]

@@Pepcoding Definitely sir! Itna toh kar hi sakta hoon aapke lye!!

[@stith_pragya]

Thank You So Much for this wonderful video .........🙏🙏🙏

[@shashanksabharwal8591]

No dislike till now, this is the power of pepcoding,,,, The only reason why i dont watch your all videos is that i know c++not java " :( i am missing such a great sessions from you,,, this is so sad ,, But i understood the concept its easy to code the same in c++, Thankyou :)

[@Pepcoding]

Welcome back

[@DeepakKumar-yl3ok]

very nice , sumeet malik sir never disappoints

[@sumantkumar6341]

sir bahut achche se samajh me aaya h

[@mickyman753]

love you sir ,boht hi pyara samjhaya

[@namanpatni8740]

owsm explaination....seriously i was about to skip this question ...just thought to search on youtube and found you fortunately ...thinking i can code ...you explained the overall picture of this question that part i like...thanks :)

[@riddhibandyopadhyay584]

Too good.... This is the kind of explanation we all need

[@Pepcoding]

Thank you so much and If you like the content could you post something on LinkedIn about us? This will help us in reaching out to more people and help a lot of other students as well Something like this Sumeet Malik from Pepcoding is making all his content freely available to the community You can check it out here - www.pepcoding.com/resources / Also, this is the youtube channel - kzbin.infoplaylists?view_as=subscriber

[@av1shekps]

Don't know why this channel is underrated?

[@ANKITSINGH-xe5wk]

this channel has true subscriber. it is increasing slowly but it will reach to top . i am sure about this

[@Pepcoding]

wow, this cheers me up. I am glad we at pepcoding could be of help to you. Keep learning. Also, recommend us to your juniors and peers, they may also benefit.

[@harshwardhanchougule3039]

Great Explanation !!!!! Your videos are best explained on KZbin

[@rishigupta7371]

We can do the same in O(1) space. Instead of using stack we can eliminate persons and update the celebrity in a variable. int celebrity(vector& M, int n) { // code here int celeb=0; for(int i=1;i

[@unstoppable9668]

Excellent explanation , Its almost more than 6 months and 0 dislikes shows how good the explanation was.

[@Pepcoding]

Thankyou beta! I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem. If you like our efforts, will you like to write a review about us here - g.page/Pepcoding/review?rc

[@MohitG7701]

your method of explanation is very awesome. You have the unique talent of making difficult problems easy. Hats off to u sir

[@hannanhub1717]

very easy explanation of concept and code

[@aindrilasaha1592]

I was a fan of your explanations, and will remain so,always! Thank you Sir!!

[@Pepcoding]

Thank you for appreciating. The love and respect which I get from you people keep me highly motivated and the same I am able to forward It to you people through my videos. So, keep motivating, keep learning and keep loving Pepcoding😊

[@kushagra4401]

thank you so much sir

[@ambarishdashora5440]

wow, You are awesome. I could never think of this question in this way.

[@ketansharma6955]

one of my favorite problems in level 1

[@radharanimathurawali361]

Very nice explanation

[@shubhamjain54519]

3:29 condition 1 3:47 condition 2 watch again to understand

[@gourangpathak276]

🙏🏻 will never forget this idea now

[@Pepcoding]

Glad it helped. For better experience, visit nados.io, where you will get well curated content and career opportunities.

[@yashraorane578]

Great explanation.

[@shubham-pp4cw]

nice and simple explantation

[@codetochange8]

Very nice explanation sir

[@kiyotakaayanokoji-pt7bs]

such a great solution, thank you sir

[@justanotherlearner1404]

amazing teaching

[@gauravbansal2998]

Awesome explanation, loved it!

[@AdityaRaj-ix5rg]

nice explanation..thanks

[@muskanshivhare6466]

Thank you for such good explanation.

[@Pepcoding]

I am glad this helped. Will you like to drop us a review? g.page/Pepcoding/review?rc

[@aishwaryaranghar3385]

ThankYou sir. You are the best

[@rishavgupta7868]

How to do this O(1) space as required in GFG question. (in this approach we are using stack of size n, it means space complexity is O(n)

[@parissweetheart96]

Instead of storing it in stack you can do like this. Assume 0 as the 1st celebrity and then iterate and check other possible celebrities. If any found update the celebrity. Rest of the step is same. int celebrity = 0; for(int i=0;i

[@yashsomani3042]

Thank you Sir , You taught really well

[@paragroy5359]

Nice explanation your videos are really good...please keep on making such videos.....you are doing a great job

[@thecodingjournal4726]

Wow this question was this easy, hats offfff

[@kashishchugh2541]

Sir, I have followed all your videos on stack and i loved all of them. I just have 2 doubts here: 1. Can't we after finding potential celebrity, now push array elements in reverse in new stack, so we will be able to check all the remaining cells, will it work? 2. How do we get the feel after seeing the question that it can be done by stacks, in earlier ques i understood because of next greatest or smallest concept, but in this ques or diff situations how do we know that we need stack?

[@Pepcoding]

Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.

[@ParasVashishth_RV]

Actually u don't need a stack here, it can be done by a simple iteration also. Stack is used just as an example

[@rishabhgoyal2835]

amazingly explained..

[@Pepcoding]

Glad you think so!

[@saurabhshandilay8261]

vaah sirji moj kr di

[@kamalkumar945]

too good explanation

[@himanshu2149]

Brilliant Sir!! Thank you !!!

[@nishantjoshi167]

awesome man....u have great teaching skills..God bless u :)

[@Pepcoding]

Thanks, you too!

[@prateeksrivastava9]

Very Nice Explanation !Keep going Sir.

[@Pepcoding]

Thank you bro. Padhte rahie.

[@asishpanda3547]

really nice explanation u just gained a subscriber, keep doing the good work.

[@aryansaxena4630]

thanks a lot sir ,great explanation

[@willturner3440]

Sir please upload more videos.. Always waiting for notification 😔

[@sunnygoswami2248]

Great explanation Sir!!

[@jobanpreetsingh2370]

Sir I know you but you don't know me So you are celebrity 😊😊

[@shaunaksensarma8351]

Fantastic solution and such a simple explanation.

[@Pepcoding]

Glad you think so! and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )

[@nandinisharma7886]

Thanks a lot sir !

[@priyankaamahour]

Thank you so much Sir, great explanation.

[@bhagirathmakwana9112]

sir, you are great!!!

[@saitama_capedbaldy9758]

It would great if he explains in English. Anyway I understood the approach. Great explanation!!!

[@hritikagarwal7676]

Thank you, sir. Your content and the way of teaching are amazing. It would be better if you provide some identification for problems related to stack. And also the intuition to this problem.

[@Pepcoding]

Sure I will

[@sachindeshpande4521]

Awesome😊😊

[@Pepcoding]

Thank you! Cheers!

[@amishapurswani9957]

sir you have explained wonderfully

[@Pepcoding]

I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem. If you like our efforts, we request a review - g.page/Pepcoding/review?rc

[@satwikjain6177]

super explanation

[@prernnajain1532]

Sir but this is of order n square as we are using 2 for loops Ranging till the length then how it is order of n please clarify my doubt sir. Thank you

[@puneethj9920]

Great video!

[@vivekdabas2011]

Explanation is nice!!

[@satyamsingh8459]

100th like here i go!, thank you sir

[@AyushSingh-lt2rq]

What an amazing explanation sir.Thanks a lot.

[@Pepcoding]

You are most welcome

[@soumavanag5025]

awsome explanation :) thanks

[@Pepcoding]

Thankyou beta! If you like our efforts, will you like to write a few words about us here (www.quora.com/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms )

[@himanshusrivastav7738]

Nice explanation dude!! keep up the good work. Hatss offf!!!!!!!!

[@Pepcoding]

Thanks a ton.Keep learning, Keep growing and keep loving Pepcoding!😊

[@SCRIPTSAG]

Bole to mja aa gya sir

[@Pepcoding]

I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem. If you like my efforts, I request a review g.page/Pepcoding/review?rc

[@kc8478]

Thank you sir

[@Pepcoding]

yahi to chaie If you like our efforts, we request a review g.page/Pepcoding/review?rc You can subscribe to our channel here kzbin.infoabout?view_as=subscriber For clearing your doubts, you can join our community on telegram t.me/pepcoding

[@kc8478]

@@Pepcoding sir ur video of tum milay dil kihlay wali bohat barhia ha :)

[@ayushgoel9584]

sir, if possible, please upload 4-5 questions per day.

[@himanshukumar1673]

Thanks for owsm content in free

[@Pepcoding]

Thankyou beta! I am glad you liked it. If you like our efforts, will you like to write a review about us here -g.page/Pepcoding/review?rc

[@aasimalikhan6353]

Amazing explanation sir.

[@Pepcoding]

I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem. If you like our efforts, we request a review g.page/Pepcoding/review?rc You can subscribe to our channel here kzbin.infoabout?view_as=subscriber

[@iuashrafi]

Great ! Great ! Great !

[@adityarathi3420]

Thanks Sir :-)

[@shivanshtiwari7109]

What a superb explanation!!🙌🙌

[@Pepcoding]

Glad you think so! Will you please drop us a review? g.page/Pepcoding/review?rc

[@amitkumargupta6722]

Thank u so much for easiest solution...

[@Pepcoding]

Keep learning and Keep loving Pepcoding

[@shubhankkhare9342]

This problem can be solved without using stack. look at the code below :- int getId(int m[MAX][MAX], int n) { long pot = 0; for(long i = 1;i

[@Pepcoding]

Yes it can be

[@princesharma8676]

thanq sir ji

[@Pepcoding]

I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem. If you like our efforts, we request a review g.page/Pepcoding/review?rc You can subscribe to our channel here kzbin.infoabout?view_as=subscriber

[@rohitangiras6476]

Hello Sir, Kya Kabhi isme aise bhi ho sakte hain kya ki arr[ i ][ j ] == 0 and arr[ j ][ i ] == 0.Then uss time stack mein kya push hoga. Thanks

[@anmolj]

Thank you sir.Really well explained.

[@Pepcoding]

You're welcome. Keep watching and keep lovingPepcoding🙏