L17. The Celebrity Problem | Stack and Queue Playlist

[@harshvardhan1214]

1:34 , Yes you are , The GOAT of DSA for a reason!❤

[@mrminus8590]

Considering all the efforts and contributions you are the real celebrity vaiya. Thanks for everything.

[@bhudevbhanpuriya7243]

waiting for this stack and queue playlist its finally here , many thanks to @takeuforward for the amazing content

[@vishalsagar1437]

i think it would be top++ down -- instead of top-- and down -- for else condition inside the while loop

[@Cool96267]

Yes

[@kanishkaparwal3060]

common sense, you can correct it yourself.

[@deepakff7498]

Is this course is completed?​@@kanishkaparwal3060

[@niyomahor6252]

Oh GOD, I was about to say yeah you are the celebrity, but it sounds more good when he said it himself. Now let's get back to the video.

[@HMBDM1976]

Hi Striver,
I just wanted to thank you for your incredible DSA tutorials. Your clear explanations and thorough examples have made a huge difference in my understanding and proficiency. Thanks to your videos, I've become very proficient in DSA, which has significantly boosted my confidence and performance in my coding
Keep up the great work, you're making a big difference! Thank you very much🥹🥹🥹

[@sachinvarma9949]

Yes, you are the celebrity Sir

[@shikhirkalia6828]

Sir ji why is the celebrity problem in the stack/queue topic? didn't see any stack/queue usage

[@pragadhishraajmp8871]

Same doubt...did you get any answer for it

[@avengersshorts5949]

Same doubt did you know the answer yet 😂

[@VikasYadu11]

Vhi soch rha hoon 🥲

[@harshitminhas5875]

it can also be solved using a stack
//User function template for C++
class Solution
{
public:
//Function to find if there is a celebrity in the party or not.
int celebrity(vector& M, int n)
{
// code here
stack st;
//push all into stack
for(int i = 0; i

[@VikasYadu11]

@@harshitminhas5875 99% Correct

[@pratyushbhatt1712]

How is this problem related to stack and queue?

[@alisheheryar1770]

Celebrity should not only nobody but also he should be known by everyone. If he know nobody and nobody know him then he becomes a tik toker, not a celebrity.

[@tanishyadav3862]

arre gajab bhai

[@charuprabha8714]

Hi but we did not use stack or queue in this

[@subhajitdey135]

An edge to be considered is what if both arr[i][j]==1 && arr[j][i]==1, so i++,j--;
so for both if((arr[i][j]==1 && arr[j][i]==1) || (arr[i][j]==0 && arr[j][i]==0)) i++,j--;
In either case if you dont add this in the code, it will still run fine, mentioned it just to improve readability.

[@AnkitRaj-mw6tp]

yaa ,I was also thinking of this while watching

[@tanmaybro3812]

If top does not know down and down does not know top as well then top and down both will not move and will cause runtime error.
I think you should explain that part like this:-
while (low < high) {
if (M[low][high] == 1) {
// Case 1: low knows high => low cannot be the celebrity
low++;
} else {
// Case 2: low does not know high => high cannot be the celebrity
high--;
}
}

[@kritwaneditz9006]

else low++ high--; because they both cannot be the celeibrity//////////////// add this condition

[@ITSuyashTiwari]

easy problem only thing to evaluate that there will be either o or 1 celebrity

[@MIRIYALASaiKrishna]

wonderful intution and thought process

[@atulwadhwa192]

what is the intuition? Also why do I need to check?

[@TOI-700]

GETTING YOU BROTHER RAJ

[@swarupdas4114]

Optimal Solution - 7:48

[@anilkumarakula6045]

every other people knows the celebrity 1 but 1 doesn't know himself ?😅

[@Cubeone11]

why are we checking if the top is greater than bottom or not ,cuz the top and bottom would end up at the same position after the while loop

[@sawan-i6u]

celebrity to ho aap.

[@SkillQuestion]

Hello, which tool you are using to write on a ipad. I want to install that tool for my sessions

[@karthik-varma-1579]

I didnot understand why did you teach celebrity problem in stack and queue playlist. I thought tis problem can be solved using stack and queues you taught bruteforce and the optmal using two pointers and where is the stack approach

[@vcIND18]

u can also solve this using stack

[@rxt740]

great solution

[@anishsood3084]

int celebrity(vector& M, int n) {
int top=0;
int bottom= n-1;
while(topbottom) return -1;
for(int i=0;i

[@nrted3877]

thanks striver

[@oyeesharme]

thanks bhaiya

[@BoredToDeath2357]

using stack we can have a better(between brute and optimal) solution with TC-O(2*n) and SC-O(n)
int findCelebrity(int n) {
stackst;
for(int i(0);i

[@keshavbadhekar]

we have O(1) space complexity in optimal solution and your solution having O(N); how can your solution is better than optimal?
but yes, thanks for giving solution using Stack as this problem is included in stack and queue playlist.

[@subee128]

Yes, you are famous.

[@athul373]

I have a doubt
why is this a stack problem ?

[@RAJPATEL-ir7ly]

You can solve it by stack also which I did when i first saw the question

[@VinitSoul]

Achha doubt he bhai😂

[@KshitijVispute-wb6ze]

@@RAJPATEL-ir7ly could you please explain how can you solve this using a stack?

[@ashwathkrishnan]

@@KshitijVispute-wb6ze Instead of using the top and down variables, push all indices from 0 to n into a stack. For each iteration, pop the top 2 elements and check if there is a candidate celebrity. If yes, push the candidate back into the stack. This way, you would be left with 1 element if there is a celebrity. You would still have to perform the final check

[@anupamtiwary4265]

Thank you.

[@DeadPoolx1712]

UNDERSTOOD;

[@carcrew_1]

thanks sir

[@AbhishekGupta-zf2sw]

1:34 , Yes you are 😂😂😂

[@sanchitdeepsingh9663]

thanks

[@subhasrisb11tha28]

🙃