Leetcode Weekly Contest 506 | Life's boring these days

[00:00:06]That's good, bro.

[00:00:08]Good morning.

[00:00:11]Good morning, bro. Good morning.

[00:00:33]Yeah, let's go. Sister, bro, what's up, bro?

[00:00:55]Hi. Hi, bro. Hi. Long time no see.

[00:00:58]Gavish, bro, where have you been?

[00:01:01]Where have you been, brother?

[00:01:04]We have 1 minutes and 10 seconds.

[00:01:18]Hello, bro. Hello, bro. Stop talking about rating, bro. I just woke up. Let's talk about rating.

[00:01:26]Please, bro. Please.

[00:01:30]All the best to your brother. Thank you, bro.

[00:01:37]You have 30 seconds.

[00:01:39]Hello, my good brother. Hello, bro.

[00:01:44]My rating is 1812 now. Same, bro. Same.

[00:01:47]How's your granny bro? Rama, I'm at my home and she's good. Okay, it's about to start.

[00:02:04]Good luck, brother. Good luck to everybody. Please God, join now.

[00:02:16]You look so broken, man.

[00:02:19]Let digit sum be the sum of digits and let square sum be the sum of squares of an integer is called good if square minus sum is greater than equals to 50.

[00:02:47]Okay. Uh, Mat return if square sum a minus b is greater than equals to 50.

[00:03:49]Oh, bro. I might have to go to poop.

[00:03:55]Falls. What the hell?

[00:04:09]114 what goes to right shift you know what let's let's go using that string version I won't even try to debug although it is very weird how this is not Okay, >> just a second. See out while n is greater than zero inverse 10.

[00:05:05]Uh, let's not even let's not even try to debug here.

[00:05:39]Uh mhm.

[00:06:05]Rule answer equals to a minus b greater than equals to uh that is square sum minus digit sum is greater than equals to 50. Done answer 5 minutes I spent on this [ __ ] already. So for the first one we getting false. Second one we are getting what are you doing bro?

[00:06:31]See how we got one and nine right?

[00:06:44]The sum is 10.

[00:06:54]Turn true if n is good otherwise return false.

[00:07:03]So see out a b 178 and 10 178 1 + 9 9 81.

[00:07:37]How is it?

[00:07:40]Oh, initialize, bro. What are you doing?

[00:07:45]Oh, I'm about to poop, bro. I'm about to poop.

[00:07:50]19 true case false I'm about to poop bro I need to go to poop [ __ ] you're given an integer arn just define a frequency balance if the subar contains only one yeah constraints 10 okay it's just th00and brute force define a frequency balance subar as follows if the subar contains only one element it is frequency balance if the subar contains at least two element then every element with maximum frequency must occur exactly twice as many as every other then every element with max maximum frequency must occur exactly twice as many as every other distinct value. Oh, I need to poop. Return an integer denoting the length. Bro, should I poop? Return an integer denoting the length of the longest frequency balance subarray. Sub longest 2 3 3 1. The element that appears most frequently are two and three. Both appearing twice, bro. I need to poop, bro. Sorry. I need to poop, bro. Sorry. Hold on, bro. I need to poop. I'm going to go to poop, bro. Sorry.

[00:09:08][laughter] Sorry, bro. I'm bad, bro. And I'll be honest, bro. Besides brute force, I can think of anything else. Would brute force work here? How many people solve this?

[00:14:13][ __ ] bro. [ __ ] [ __ ] bro.

[00:14:17]How many people solve this? 190. Not not many.

[00:14:23]10 Q uh time complexity to find every subarray.

[00:14:40]Counting the subarray.

[00:14:43]Generating. Processing subarrays.

[00:14:50]So it is n square right total subar which scales quadratically I think let's just bro you know what let's just try brute force I don't want to run my mind chat life feels so Nice. Once you get a good poop.

[00:15:25]Okay. What is it even asking? Subar contains at least two elements. So a subarray. Well, honestly, we can also do it using What is the third question? Is the third question first part of this?

[00:15:35]No. So, let's I think let's just do brute force.

[00:15:43]Yep.

[00:16:15]Yep. JL Wait.

[00:16:21]Yeah. I mean it it did uh without printing you, bro. Hold on.

[00:16:43]I mean a sub array sub array of array in CPP. It is N cubed, right? What is this new stupid?

[00:16:58]What the hell is this print K elements?

[00:17:10]Yeah, it's going to be N.

[00:17:15]What the hell?

[00:17:18]How many people solved it?

[00:17:22]440.

[00:17:41]It's going to be NQ bro. [ __ ] That's not going to work.

[00:17:47]Ning longest frequency balance subarray.

[00:17:51]Subarray is a contiguous non- empty sequence of elements within an array.

[00:17:55]Okay, if we actually think about if we go with a sliding window uh if we go with a sliding window then it's going to be what the condition would be number of unique elements you want at least then every element with maximum frequency L equ= to max L - R + 1 length equals to max frequency right max frequency star L with max frequency. Okay. What is the max frequency into how many elements exist with max max frequency plus plus with not max frequency.

[00:19:02]So that is what are yes unique le not with max frequency. Okay, I think we might just need to go with sliding window then because it it goes up till 1,000. Yes, L equals to Z. R= to Z while r is less than uh error dot size.

[00:19:33]Bro, but the point is so we want to figure out the max frequency and the frequency of max frequency.

[00:19:41]Yeah. Singing through the line set of how many it goes up till 10 to 9. Stupid ass.

[00:20:13]uniquely with not max frequency set in this at max it's going to be oh I think we can just run set s uh unordered map which stores the frequency of your current element.

[00:20:50][cough] Now what we're going to do is r dot uh your your your your s dot insert error r and increase its frequency frequency of r ++ return the longest frequency. Hold on.

[00:21:15]But I got no but how do we expand and contract in here like 2 2 33 31 If you think about it, uh, return an integer denoting the length of the longest frequency balance.

[00:22:04]I think it is If you think about it, uh 555 1 3 4 H two besides that hold on.

[00:22:32]Okay. Okay. If the subarray contains at least two elements, then every element with maximum frequency must suggest exactly twice as many times as every other distinct.

[00:22:44]Hold on, hold on. The question says every element with maximum frequency must occur exactly twice as many as every other distinct value in that subarray equals to Distinct values star two other distinct value star two.

[00:23:14]So frick can either be one twice as many as every other distinct value in that subarray 2 3 1. The elements that appear most frequently are two and three both appearing twice. The remaining element one appears.

[00:23:36]Okay. One appeared one meeting requirements pair.

[00:24:02]Okay, I think we can do it in n square by maintaining a prefix sum, right? For frequency. Come on, we can do it. We can do it. If we maintain a prefix sum for frequency, then checking whether an element, oh my god, damn. What a prefix sum would tell us the frequency in a subarray. Yes, it would. Right. Uh and but we also need the unique elements.

[00:24:33]We also need the unique elements in any window. The unique elements. How many people solved it?

[00:24:40]1 th00and plus, right? 1.1. Okay. uh we can use a prefix sum to find the frequency in any any window and to find the number of unique elements. I think we also use a prefix sum I think. Yeah.

[00:25:08]find the frequency of but you would also have to hold on but how does that help that does not help like if I go to that does not help.

[00:25:41]It does not help. 333 33 and 21 could also be an answer. No, that cannot be an answer.

[00:25:58]That is valid. 1 to2 is valid. Oh, hell no, bro. The love story of second question [ __ ] me in the ass every time.

[00:26:07]So it is 10 cube, bro. So there's definitely an easy thing that I'm missing.

[00:26:16]Let's say I give you a subarray.

[00:26:21]Every element with maximum frequency must occur exactly twice as many as every other distinct value in that subarray.

[00:26:32]distinct I don't we knew distinct were three maximum frequency was five distinct were three max frequency were five uh were two so we knew 2 2 1 2 2 Uh 2 2 3 4 5. What if like this though 3 4 5?

[00:27:16]Wait. So do we only need distinct and max frequency? Is that enough to find out whether it's Hold on. Is that enough to find out the distinct elements and the max frequency?

[00:27:27]But for the for the max frequency. It's another N cube, bro. I'm trottting into N cube.

[00:27:40]Holy [ __ ] L of the longest frequency valer.

[00:27:52]What is the next one?

[00:27:56]But I can't go into the next one until I solve this.

[00:28:02]Let's let's So you want to find uh find you want to find longest balanced sub array.

[00:28:26]Then uh creating all SARS in CPP but we can't be going N cube.

[00:28:42]We can't be going N cube in there. So we want to find the longest valid subarray.

[00:28:49]Valid subarray.

[00:28:51]Valid sub array equals to valid subarray key conditions are max frequency equals to two stars two star non-max leas right so we had max frequency is two and distinct as 1 2 3 1 2 3 distinct as three because we were bound.

[00:29:55]valid.

[00:29:56]Hell no. Hell no. Hell no.

[00:30:17]Bro, how many people solved it? If more than 2K people have solved it, there's something I'm missing.

[00:30:23]There is something I'm missing.

[00:30:27]There is something that's I am missing.

[00:30:33]I'm like Num's length is just 10 cubed.

[00:30:42]See, let's look at it from the other approach. Just find the like the number with the maximum frequency.

[00:30:53]Now to make it balanced exactly as many times as every other distinct value in the subarray.

[00:31:09]Okay. So for any number we can add other numbers.

[00:31:41]special.

[00:31:43]Yes.

[00:31:45]But the point is we we're still max frequency into special LE equals to unique minus special L* 2. Now special LE equals to distinct LE with max frequency. Okay.

[00:32:10]Yes. So this is this is how to check this is your condition for a good subarray right this is your condition for a good subarray especially all those elements with maximum frequency bro I don't I definitely don't think so this is super easy because if only 1.8k people have done it in 30 minutes generally it's like 5k 2.2k 2k I've done it.

[00:32:41]Uh then every element should I just try brute forcing it? The frequency of an element x n cub bro cub n cub would nq work constraints for nq cube solution.

[00:33:28]Maximum input size less than 500. Bro, this is 1,000 elements might pass if hold on under 1,000 it is. You know what? I think brute force is worth a try.

[00:33:59]Let's at least get our penalty.

[00:34:01]J++ Okay. Less than equals to J.

[00:34:35]Setting S. And uh Uh, I + one, bro.

[00:35:01]I go from zero to fair. Uh, K less than equals to J.

[00:35:08]>> [cough] [laughter] >> Yes.

[00:35:15]Now what you're going to do is okay to check you find frequency setting and uh max frequency that I mostly are two and three both appearing twice.

[00:35:47]Uh, if we I was thinking of using No, no, no, no. This is an overkill. This is an overkill, bro. This is surely going to give a T.

[00:35:57]Why am I even doing it?

[00:36:28]You can just say f of uh error r i er k++ s dotinsert ark. Okay. S dot insert ark k. You would want to insert that element increase its frequency and max between max frequency comma frequency of error K frequency of error K. Now all you need to do is check.

[00:37:18]See that's the point.

[00:37:22]Int length would be j - i + 1.

[00:37:28]If he say, "Bro, what the hell?"

[00:37:41]3k people have done it. Just say it. 3k people have done it. Thank you. Uh uh uh. If the sub contains only one element, it is free. If the subarray contains then every element with maximum frequency must occur exactly twice as many as elements with distinct value in that subarray.

[00:38:06]Okay.

[00:38:17]Constant auto and if frequency of L is not equals to 1 and frequency of L is not equals to max frequency but max frequency should be equals to twice. That's the point.

[00:39:11]Max frequency should be equals to twice.

[00:39:17]So frequency so it's 2 two two two frequency two frequency two frequency and in the end you have like six and seven that is wrong that is wrong that is If frequency of your LE equals equals to 1.

[00:40:12]Bro, I'm over complicating it. I'm over complicating this. I have this exceptional habit of over complicating everything though.

[00:40:23]frequency of your if uh max s + 1's equals to equals to r + l r is going to be uh j - i + one and add you can say max is G3 max frequency equals to equals to on* 2 then answer equals to max between answer comma R uh J minus I + 1.

[00:41:28]What code have I even written, bro?

[00:41:32]I'm just tired, bro. I'm just tired.

[00:41:37]One hour.

[00:41:55]Like, bro, you can't even do brute force. You're cooked. You can't even do brute force, bro.

[00:42:06]Bro, 3.6k people have done it.

[00:42:12]3.6K people have done it.

[00:42:34]So we would want to find Yes.

[00:42:37]H.

[00:42:42]What is wrong with honestly my logic should be correct bro. What is wrong with my logic? First of all see out I J right 0 1 02 Yes these are all the subarrays bro how these are all the sub areas 3.8 28k people have done it, bro. But chill.

[00:43:15]Yes, the subarus counting is working fine. Now we're going from k= to i less than equals to j frequency r s insert r or maximum frequency between maximum frequency and frequency of rk.

[00:43:48]The condition can be if Max frequency star specially max s* star uh that is into your max frequency if that is equals to 1* 2 sorry Sorry and and and and max S + 1's equals = to R = = to J - I + 1 then answer= to max between answer, J minus I + 1. Yes, brother. Why are you not working today? You can't rage me lead code because yesterday I ran the first 5k of my life.

[00:45:17]One one dumbass is saying 111 4K have done it.

[00:45:32]Then every element with maximum frequency must occur exactly twice as many as every other distinct value in that sub array.

[00:45:44]Twice as many times as every other distinct. Oh, it's not bro. It's not like every other would be one.

[00:46:16]Maximum frequency equals to normal* 2 and max plus normal J minus I + 1. So then it's going to be yes. It is still not working.

[00:46:31]Frequency of LE equals equals to max frequency then max S+.

[00:46:38]Bro, what?

[00:46:43]Think web of think.

[00:46:46]Think think. See out see out normal comma space max s comma chill bro you can't rage with me you can't you just can't zero Max frequency.

[00:47:27]Max frequency. The max frequency equals equals to O.

[00:47:39]can write if normal minus I + 1 right the answer should be between 2 2 1 2 3 2 1 2 3 3 So that is 1 say 6 each.

[00:48:21]0 1 2 3 4 5 6 one or two on it.

[00:48:39]Man, I give up, bro. 4.6k people have done it and I can't even write the brute force.

[00:48:50]Just think from a clear mind, brother.

[00:48:53]Just think from a clear mind.

[00:48:59]We only care about the elements with max frequency.

[00:49:05]Okay. So, okay.

[00:49:17]Constant of your s.

[00:49:23]How to iterate elements through a set in CPP.

[00:49:35]That's exactly how I'm doing. Then we say let's try writing this logic again.

[00:49:51]and k = to y k less than equals to j k + right now in here in here what we do is we create a set set of int let's call it my set and let's create a int max frequency equals to z okay okay Okay. Okay.

[00:50:26]Now what you do is for Oh, you don't create it here. You create all of this here. Okay. Now what you do is my set dotinsert a r k. And you also need to do uh frequency of frequency of an order map.

[00:51:10]frequency of your let's say your element ark ++ and your max frequency think about it you have a subarray in that subarray you would want its length you would want how many elements occur with the maximum frequency and you want the maximum frequency Right.

[00:51:38]You want these three things.

[00:51:49]It is kind of like bro that wouldn't work. So for every subarray you want a set of frequencies kind of kind of kind of 40 minutes before I lose rating fair at this point I'm not even surprised maximum frequency equals to max between max frequency and frequency of error k okay Now for constant auto and Ellie of S.

[00:52:45]Bro, why do I still feel like pooping, bro?

[00:52:50]Do I just end the stream and end this contest?

[00:52:54]My stomach is upset right now and so is my mood.

[00:53:00]uh max I haven't even read the third question for if frequency of LE equals equals to max frequency then you can say max s + now in the end J minus is I + 1 that is going to be your length right 6 - 7 - 6 + 1 Bro, I feel like this logic is a bit cleaner now. Okay, hold on.

[00:54:13]My set.

[00:54:23]And okay, one case says that max s= = to j - i + 1.

[00:54:44]Then at least this should be working.

[00:54:46]This should be working, bro. It is still one.

[00:54:57]I can't write boot force.

[00:55:10]This my elements with maximum frequency.

[00:55:23]Oh, stupid ass. Dumb max frequency.

[00:55:30]Hold on. I made a mistake in writing my logic.

[00:55:34]2 3 4 F four. How is it?

[00:55:48]If max frequency equals to J minus 1 R four R here it is coming three bro I I kind of give up bro this question is not for me this question is not for me bro do third it's very easy do third it's more easier bro is third easier third is 2.4k For K you're given 2D integer units of size MN where units I J represents the capacity of J unit each divide.

[00:56:41]Okay let's focus on third for the next 20 minutes. For the next 20 minutes we're only focusing on this. You're given a two integer array of size M cross N where units I J represent the capacitor of J unit J is unit I is device each device contains N units the rating of the device is the minimum capacity amongst among all its unit you may perform minimum you may perform choose a device I that has not been used before remove exactly one unit from device I and add it to uh any different device then mark the device I as so it cannot be choose as return the maximum possible sum of rating of all devices after any such operations.

[00:57:30]Devices can receive multiple units from different devices. So a value can go from one row to another row regardless of whether they have been selected. The rating of an empty device is zero. Uh empty means Select device I equals to 0 and transfer unit 000 to 1 to device I equals to 1. After the transfer device 0 the ratings are device 0 to 2 or one. Okay.

[00:58:14]Does the sum of rating is device?

[00:58:26]Hold on.

[00:58:29]Four.

[00:58:33]2 + does the sum of rating is return the maximum possible sum of ratings of all devices after any why did we transfer one then why did not we transfer three I hold on I didn't understand the test case select device I equals to0 and transfer unit 00 to device 1a After the transfer the ratings are rating three, right? Oh, you want the sum.

[00:59:14]Okay. What? You want the sum of ratings?

[00:59:18]Four and four.

[00:59:28]Rating one.

[00:59:30]device one 221 the rating of a device is the minimum capacity amongst all its unit oh minimum capacity oh okay I didn't read that line so in any row the minimum number oh so it's and it's 10 to 5 10 to 5 Okay.

[01:00:05]Minimum number.

[01:00:13]Fair. Fair. Fair. Fair. Fair. Fair.

[01:00:17]10 to 5 units. High length.

[01:00:25]Man. So bro, neither is this easy for me. I'm bad at DSA in every format whatsoever, bro.

[01:00:40]Every format whatsoever.

[01:00:46]So score of any row equals to its mini minimum value.

[01:00:55]We can move what you choose a device I that has not been used as source before.

[01:01:08]Okay, we can move minimum value from any row to any other row once.

[01:01:25]write only once. So for any row the score can be it smallest value or second smallest value. Okay.

[01:01:43]Okay. So basically for every row every row find the smallest and second smallest you would want right find the smallest and second smallest.

[01:02:06]We would want the maximum second smallest to exist and put that smallest. Put the smallest of that row into into another row with biggest smallest. Bro, what am I even saying?

[01:02:38]But at least the Okay, I can think of some logic. With the biggest smallest.

[01:02:43]No, no, no, no.

[01:02:49]always put it in one row itself. I think with smallest smallest the Oh, right.

[01:03:20]Bro, hold on. At least it's making some sense. For every row, you can either get it smallest or second smallest value.

[01:03:27]Right?

[01:03:29]If we go greedily, we would want all the maximum second smallest values and insert all the smallest value.

[01:03:50]Bro, I think this is it then. This is greedy then. Is this greedy, bro? Yeah.

[01:03:56]Insert.

[01:03:57]I think, bro, because in one row you can insert as many as you want.

[01:04:02]#define ll long.

[01:04:06]Let's at least try doing this, bro. So that we don't end up resolving. First question, brother. Let's try. So in i equals to0 i less than units dotlength length i ++ j = to0 j less than units of i.length J++ smallest equals to uh what are the is 10 to 5 in smallest equals to int max int smallest second smallest basically equals to int Max smallest equals to smallest equals to min between smallest comma uh your units of I J units of I J if units of I J is greater than what if C We can't be sorting every that is stupid. M star any two star 10 to 5.

[01:06:06]One way to do is is to just do sort every sorting might not be the best option.

[01:06:23]If it is greater than smallest then we can just say smallest two equals to minimum between smallest 2 comma units i j.

[01:06:38]Let's hope this gave us if smallest two let's say if it's all made up of two then smallest two would be int max then smallest two equals to smallest okay now you have a pair where do we H.

[01:07:15]Uh, we would want the maximum second smallest to exist.

[01:07:20]Put the smallest of that row into another row with the small. Bro, this is greedy. This is greedy. I can look at it now. This is greedy. This is greedy 100% bro. This is greedy.

[01:07:37]Just maintain vector of vector of not vector of pair of int int uh uh pairs. Okay.

[01:07:56]store two smallest store to smallest and smallest. Okay, now you can just say pairs dot push back uh pairs dotpush back to smallest because we want two smallest to exist and smallest. I hope I'm going in the right direction. Then you sort your Then you sort your pairs.

[01:08:26]How to pairs dot r begin pairs dot r end.

[01:08:36]How to reverse sort in CPP R begin RN yes r begin R end right after you do that you'll get the biggest second smallest And the last ele will be smallest, second, smallest, and smallest. Smallest.

[01:09:25]Fair. Fair. Fair.

[01:09:30]Now what you need to do is for I less than pairs dot length i ++ bro I'm feeling good about this question bro till now I'm feeling good about this question if i= We'll just move the smallest to then you have to handle it.

[01:10:10]Int global smallest equals to int max.

[01:10:17]Then you handle it something like this.

[01:10:19]else uh answer plus equals to sorry keep it pairs pairs 1 l* pairs of uh you're going to zero right now if i + 1 equals to pairs dotlength and you can Say global smallest equals to global smallest uh minimum between global smallest comma your pairs of i move. Now last second smallest LL2 add equals to minimum between LL2 add will be equals to minimum between pairs of I comma 1 comma global smallest and then answer plus equals to one star one LL star to bad.

[01:11:35]I think I've written the raw logic. Now I just need to fix the stupid mistakes I might have done. If this is not the approach, bro, then I'm pretty sure I can't solve it. What?

[01:11:47]Oh [ __ ] What are you doing, bro?

[01:11:53]Damn. I've been Bro, I've written Honestly, this is so much better.

[01:12:16]Now what is the issue? Push back smallest two.

[01:12:31][snorts] What bro?

[01:12:39]dot second first dot second four six you So let's not yeah let's not jump super soon. First of all let me handle all the int overflows bro. Let me convert every int to it is working. It is working. The code seems to be working. I broke my code.

[01:13:40]I broke my code, broke to save my ass from int overflows. Four, six, and the third one is also six. Let's Bro, how did 4,000 people now suddenly solve it?

[01:13:52]So, what we're doing is I think this is correct.

[01:13:59]I think this is correct. This is greedy, bro. Let's submit it because there's no way I can I knew there's going to be a wrong answer but so 1 2 1 one this is already pairs first of all see out bears see out pairs i dot first pairs i dot. Let's hope I don't find a flaw in my logic. A minor flaw, bro. If my logic is incorrect, bro, then I'm doomed.

[01:14:52]Use this test case, brother. Brother, use that test case, please. We're in a good mood today, bro. Doesn't matter if you look second smallest. So it's going to pick one two one.

[01:15:06]The expected is five.

[01:15:12]How is Hold on.

[01:15:15]1 2 1.

[01:15:17]Oh my.

[01:15:20]It looks like a second bro. It looks like a flaw in how I'm calculating second smallest bro.

[01:15:38]See out smallest to smallest, bro. What?

[01:15:52]So one one second row.

[01:16:06]Oh, n login into n.

[01:16:20]Bro, I think the best way to find second smallest is to just sort.

[01:16:27]Yes.

[01:16:32]Is to just sort units I dot begin.

[01:16:43]I don't know, bro. I'm sorting. I'll I'll handle it later. Comma. units I do.

[01:16:49]Nend. Once you sort it, then you can say smallest equals to units units I 0 and smallest 2 equals to units I1.

[01:17:18]No matching function.

[01:17:24]Unit size a vector. Bro, what are you talking about?

[01:17:36]Okay, I think we just need to sort it at the very start. Sort units dot begin comma units dot end 4 6 case six okay and now it's four now it's four the expected was Please h how does 2D sorting work? Does it just moves every element?

[01:18:27]Does it just move every element?

[01:18:31]Yeah, I think that's what it's doing.

[01:18:45]2D sorting in CPP.

[01:18:50]2D sorting just moves every element, right?

[01:18:58]This is highly common when treating rows like database where you want to reorganize the rows using one specific column as the key. You can pass a lambda function.

[01:19:07]Sort each row independently. Yes.

[01:19:12]Yes. That's what I want to do. That's what I want to do.

[01:19:21]That's what I want to do. But it's for auto and row.

[01:19:27]I think I'll have to do it separately.

[01:19:29]for auto and row of my units.

[01:19:35]Sort row dot begin, row dot 5 4 6 bro, but sorting might give us t.

[01:19:55]That's the whole point.

[01:19:57]sorting might give us daily man.

[01:20:08]Let's try submitting it. We just have 11 minutes buffer.

[01:20:20]Oh, what are these stupid test cases my code is failing at?

[01:20:30]If units do size is greater than is greater than one.

[01:20:57][ __ ] bro. My My stomach is not good today. My stomach is not good.

[01:21:08]Units of I, you dumbass.

[01:21:16]4 6 5 and 19. Yes, that's 5 + 44 + 1.

[01:21:28]Global smallest is between the smallest.

[01:21:34]Yes.

[01:21:44][singing] At least, bro. This was not a contest wherein I solve only one question. My rank is terrible. I know it might be five digits, bro. My rank might be five digits.

[01:22:00]15K after. Nah, bro. It can't be 15k, bro.

[01:22:05]Bro, 15 15k even though I solved the third question.

[01:22:14][ __ ] We need to think about the second question. If the subar contains 5.7k people have done it. How bro? How? 8.4k people have done it.

[01:22:33]You want in every subarray you want how many what is the max frequency?

[01:22:40]What is the number of elements that have max frequency and its length? That's that's the three things you need in a subarray.

[01:22:49]We're going to try brute forcing this.

[01:22:55]We want the max frequency.

[01:22:58]How many element has that max frequency?

[01:23:03]Right? That's all we want.

[01:23:13]That's all we want in the end. In the end, max frequency equals to total unique minus max frequency value elements star two star two. That should be enough. That should be enough.

[01:23:40]Hm. Now for in k = to i k less than = to j k++ bro 14k even though I saw the third question. What was why rank with the first question then it only the first question. Oh it's 5k me that's how we like to say bro 5k is not bad for a for a guy like me who is bad at DSA bro I think 5k is okay. It can be better, bro. But I think 5K is okay for a guy like me who's bad at DSA, bro. Bro, and I love you, Shayan, for suggesting me to solve the third question first, bro. Not even joking, bro. Love you, brother. Life, bro, bro.

[01:24:21]My Sunday would have been ruined if I was stuck on this question. If I was stuck on this question, we need to lock in now. Uh, my set dotinsert my set do.insert K. Okay, you insert that into your set.

[01:24:47]Now what you do is frequency of error k badaria. Now what you do is maximum frequency equals to maximum between maximum frequency and frequency of a r k maximum frequency. Now what you do is first of all if maximum frequency if maximum frequency equals to equals to J - I + 1 J - I + 1 then maximum answer equals to max between answer comma J minus I + Okay.

[01:25:36]Max frequency.

[01:25:40]Else in total unique equals to s dot 10. Bro, hold on. What?

[01:25:51]How do we find size of set in CPP?

[01:25:59]It's just the size, right? That just tells you. Yes. my set dots size uh my set dot size. Now what you need to do is if man you also would want to know bro you also would want to know how many elements have maximum frequency that's all so is there any better way to do this I mean I can't think of different approaches now the time is running out let's at least see if we get a t you would want to set stores in a sorted manner in CP. It does, right?

[01:26:58]But it's it's going to store and frequency is only finalized after you see the entire array. So I guess we would have to we would have to for constant auto and any of your my set if bring this down.

[01:27:34]uh you just do if uh frequency of your current element equals equals to max frequency then you can say max s+ continue.

[01:28:02]Now the logic becomes if max frequency equals to equals to total unique minus max s* star 2 then you can say answer equals to max between answer comma j - i + one. I don't even know if this is going to work.

[01:28:37]Five. Hold on. Four. Hold on. One.

[01:28:54][ __ ] you, bro. [ __ ] you, bro. I'm dead, bro. 162. We're getting three when the output should be four, bro.

[01:29:03]I can't even debug at this point. I can't even debug at this point. We can't even debug at this point, bro.

[01:29:12]Two maps. It will be T. Yeah, bro. I'm using two maps.

[01:29:20][snorts] Two maps, bro.

[01:29:23]Third, but second.

[01:29:26]Same, bro. Same. Same, bro. Same.

[01:29:30]Same. Look at Jansen and Froy laughing like an [ __ ] bro. Bro, my rating was exact 2048 for 5 minutes lead.

[01:29:44]Damn, bro. Bro, did you solve the second question?

[01:29:49]Bro, third is doable. Third is greedy.

[01:29:51]Bro, what was third's instruction? Third is just greedy. Sitan, brother, I love you for telling me to do third. We have given up.

[01:30:00]Basically, if there are more than one element, not in terms of count, but in terms of unique elements, then there should be frequencies in the sub area.

[01:30:08]Maximum frequency, maximum frequency too.

[01:30:11]Hold on. Is this guy cooking, bro?

[01:30:16]Second map.

[01:30:21]Second. How many am I using? I'm using an unorded map and a set. So maybe I mean I'm not going to solve it any further but it's just one minute.

[01:30:41]It's like frequency hashmap stores values and other hashmap stores frequency sort br bro that is exactly how I'm doing.

[01:30:53]I'm sorting the unique elements and the frequency even then like I'm failing if maximum frequency equals to total unique minus max s* star two then answer j minus i + 1 max frequency is itself I don't understand max bro this logic should be correct what is breaking even here like how do I even figure out 111 output should be four I can't even debug see I J and your 18 seconds never mind I at least I did the third question.

[01:31:57]Second, bro, I Bro, just chill, bro.

[01:32:02]Chill. Third was so much easier than second, bro. To be honest, the description was so vague. 555 should be four. Any map to store normal frequency and others to store frequency of max occurring elements.

[01:32:18]Max occurring elements. What is bro yapping about, bro? But we did the third question. Show the code for question three. Let it end, bro. Let it end. The third question was greedy. The third question was greedy, bro.

[01:32:31]Okay, it has ended. For those who want to see the solution for third, bro, it was just greedy.

[01:32:42]How the hell am I never able to do the second question these days, bro? It was just greedy. So what you can do is the only scores for every row there's going to be a score for every row. You can either get the score as the smallest elements or its second smallest element.

[01:32:59]Right? That's all you can do. Either get the smallest element from a row or it second smallest element because you can't move things more than once. You may perform Yeah. remove exactly uh once the once you move an element from a row it you cannot move another element that's why you can only get the smallest number or the second smallest number as the score from a row so just go greedily pick up all the biggest pick up the row with the smallest smallest and keep putting in bro I've written my approach here understanding greedily we would want all the biggest second smallest and we'll put every smallest value into one row. If you want to see my code, bro, I wrote some [ __ ] global smallest.

[01:33:52]Yeah, I maintained a pair, a vector of pair which basically which stores the second smallest and smallest. We would want all the biggest, second, smallest in our answer and one row with the we don't care. That's how I did it though.

[01:34:07]That's how I did it.

[01:34:10]Eat code is taking revenge for not respecting second question. Bro, lead code, bro, you've been [ __ ] me in the ass. Please stop, bro. Please stop, bro.

[01:34:19]Please stop, bro. Because of that real second question, bro. I'm so sorry. Lead code, bro. So sorry, bro. If anybody is watching from the lead code headquarters, bro, I'm so sorry. Please start giving second questions easy again, bro. Please start giving second questions easy again.

[01:34:36]Bro, isn't built today?

[01:34:39]But honestly, my hair looks good. What are you talking about? It looks good.

[01:34:44]Group play scribble.

[01:34:46]Bro, we we need to we need to understand. Solve three by four rank three ammon brother. Nice. Six wrong attempt in second. Still not able to solve bro. Second was easy. Hi bro. Here comes the aura farmer. Here comes the guy farming aura. And you know what? He has done an all kill again bro. Sart bro. Bear. Yeah, bro. Don't change entrant hub. It's not updated yet. Okay, bro. What is my rank, though?

[01:35:14]My rank is my rank is please be in 5K. Please be in 5K.

[01:35:24]But I think after the cheaters would be updated, bro. It's going to be in 5K.

[01:35:29]This is in the recent times my best rank. I know it is crazy that I consider 5K as a good rank, but recently I've been doing so bad in lead code contests that this is a good rank for me now.

[01:35:42]Like if you look at my old contests, bro, w their UI is so ass. You can't see the rank now. Oh, you can. So my rank in today's contest, it's almost 5K. I mean in it's 6K, but recently 7K, 11K. Okay, I did get a 5k rank. Fair. 9K, 13K, 6K, 2K. This was my peak, bro. 2K. How did I used to get a rank like this? 2K, bro. I can't never get a 2K.

[01:36:16]Hi. How did you Yo, James, what's up, bro? You said you're back to contest.

[01:36:20]Did you not give to this contest? Did you not give to this contest? I was watching NBA.

[01:36:25]Damn, bro. NBA. What time does NBA stream? Okay.

[01:36:31]Okay, bro. Today's contest I got I got [ __ ] by the second question. The second question was too tough, bro.

[01:36:37]Police GF lover, what are these people yapping, bro? Let's Do we need to Do we need to hop on Discord, bro? Do we need to hop on Discord? Hold on. Let's hop on Discord and discuss the second solution, bro. We need to discuss the second solution. Hold on.

[01:37:01]Hold on, bro. Hold on.

[01:37:04]Hop on Discord, bro. We need to discuss the second solution later, bro. Later.

[01:37:09]You going to I lagged today. Lamar was watching Nick, bro.

[01:37:14]I mean, fair decision, bro. Doing literally anything is always better than attempting a lead code contest. Let me be honest, bro. Fourth was a nice problem. I didn't even read fourth question, bro. We didn't even read fourth question. Can someone answer this? How are we going to get subar sum equals to 80 here? What even question?

[01:37:34]What question is even this, bro? What question is this?

[01:37:39]Subar sum. Is this the fourth question?

[01:37:44]Is this the fourth question, bro? Bro, nobody even read the fourth question.

[01:37:48]Pra, bro, shut up, P, bro. Like, nobody even saw read the fourth question.

[01:37:54]You're talking about solving it. Just chill.

[01:37:58]It's fourth, bro. Chill. Gio guesser.

[01:38:02]Gio guesser. Hold on. Before we play Geio Guesser, let's get into study room.

[01:38:14]Let's get into study room.

[01:38:18]Get into study room.

[01:38:22]Guess hold on.

[01:38:42]Hello bro. Hello.

[01:38:47]Nobody is speaking bro.

[01:38:50]Hello bro. What's up?

[01:39:03]Second or third.

[01:39:12]Second Second overall 5.800 800.

[01:39:49]Third, please. Second guess.

[01:40:15]Frequency count.

[01:40:36]Holy code. God forbid a man can't even ask his doubts, bro. Nobody solves the fourth question. Bro, shut up. Is that guy even audible? You guys can't hear him.

[01:40:49]Incorrect. Second one.

[01:40:57]Just know 183 x =0 x for i = x i plus 2 frequency.

[01:41:58]Huh?

[01:42:22]Element.

[01:42:25]Frequency frequency minus The smallest the smallest maximum I See the smallest frequency or maximum frequency.

[01:43:34]Maximum frequency. Maximum frequency 4 44 is 1 or two. One or two answer four is answer.

[01:44:03]Uh second Max frequency 412.

[01:44:48]What is this question?

[01:45:02]Max obvious Maximum numbers Maxen maxum.

[01:46:03]J I max9 I00 [clears throat] first >> [clears throat] >> I started doing maxquencia.

[01:47:15]elements.

[01:47:26]Smallest or secondstal.

[01:47:36]>> [laughter] >> like why are you assuming already kill.

[01:48:31]>> [laughter] >> All dumbos. In one minute brokough todayough.

[01:49:11]question if I remember why.

[01:49:37]Okay.

[01:49:44]First question sliding window.

[01:49:57]Second sliding window.

[01:50:04]Second question.

[01:50:20]Second question.

[01:50:48]with frequency.

[01:50:50]Max her element frequency or her frequency frequency.

[01:51:12]Okay.

[01:51:19]Bro. Okay. Okay. Okay. Then positive positive. Yes. Plus 1.75.

[01:51:33][clears throat] [laughter] plus 15 plus one. Finally, bro, we not losing, bro. At least [laughter] pe Nice, bro. Nice.

[01:52:33]Maybe second final round.

[01:52:49]Yeah. Congratulations.

[01:53:05]Hello. Hello.

[01:53:09]Max Uh 255 59.

[01:53:26][laughter] gets richer. Rich gets richer. Poor gets poorer.

[01:53:52][laughter] lead.

[01:54:24]What is this guy?

[01:54:45]sources. CP algorithms.

[01:55:06]question.

[01:55:29]See the CF CF scratch.

[01:55:44]in the sense binary searching searching question.

[01:56:24]Fourth binary search.

[01:56:27]Fourth, you're allowed to ask [laughter] Shambashi service and lead Good.

[01:57:12]Sorry.

[01:57:25]office.

[01:57:28]Okay. Okay. Nice, bro. Nice.

[01:57:32]Okay then. Thank you. Thank you for joining. I leave this meeting up, guys.

[01:57:37]You guys continue. Bye-bye, bro. Sarak for sure is going to meet his girlfriend.

[01:57:46]Bro, Sarth is going to meet his girl, bro.

[01:57:57]Bro, what is bro yapping about?

[01:57:59]Algorithm engineer.

[01:58:02]What is bro yapping about?

[01:58:05]Plus 31, bro. J got a plus 31, bro.

[01:58:09]What?

[01:58:11]Plus 31. That is crazy. That is crazy.

[01:58:16]Second leave.

[01:58:21]Second, bro. I I didn't do second. I didn't do second.

[01:58:26]We didn't do second. Bro, in the starting I was able to solve second question regularly. I used to take so much time. But when it was time to improve, lead code started giving second question that take one hour. Bro, lead code second questions are crazy tough, bro. These days exactly bro. Exactly. Second. Yes sir.

[01:58:47]Yes sir. I slept through my contest and easy specialist. Bro, what are you doing? Sleeping coder army spring boot.

[01:58:59]Nice bro. Do it then.

[01:59:01]Do it. That's it bro. I guess that's it bro. Enjoy your Sunday. Life is much more than lead code. And you know what?

[01:59:10]I'm also on on a side note, bro. On a side note, okay, on a side note, I didn't talk about this. I didn't talk about this. But we need to talk about this, bro. We need to talk about this.

[01:59:25]This is a moment to either regret or celebrate. But look at this number. We have been doing lead code for every day since the past one godamn year. How crazy is that? Yet I'm still ass at it. I have the 365 days badge. I've given 50 contests, almost 50 contests now. And I've been doing lead code every day for the past one year.

[01:59:50]Bro, am I stupid? Even after doing it daily for a past year, I'm still trash at it. I'm still not guardian or anything, bro. But you know what? For this occasion, for this occasion, I'm filming. I'm thinking to film a long long format video, bro. Talking about this one year anniversary of doing lead code every day. Gave my first contest. Was able to solve first but got cooked in second.

[02:00:18]Bro, today's second question was good.

[02:00:20]Yes. And woke up at 5 today to study and then went for a run. Bro, talking about run. Talking about run. Talking about run, bro. Dip J. Bro, hold on. Hold on.

[02:00:31]This guy said run. Can we open Straa on on here?

[02:00:37]Straa.

[02:00:39]Straa, bro. Login. Log in. Sign up with Google.

[02:00:44]Uh web.

[02:00:48]Login, bro. Log in, bro. Dj, bro. For the first time in my life, I did a 5K, bro. Be honest.

[02:00:58]How good is this pace?

[02:01:02]The [ __ ] bro? I'm not even showing. Be honest. How good is this pace, bro? This was the first 5K of my life. I ran a 5 kilometer in 3830. The pace was 736, bro. How good is this, bro? How good is this? Should we look at the replay?

[02:01:20]Let's look at the replay. Not a standard map. We need a satellite map.

[02:01:26]Bro, I just realized I leave my location. I mean, who cares, man? Who cares? Who cares? It doesn't matter.

[02:01:32]Let's look at the replay, bro. What? Why can't I zoom in, bro? I can't zoom in or anything.

[02:01:47]What a stupid GPX, bro. I can't zoom in or anything.

[02:01:58]on. Oh yeah, we can. We can. Okay, look.

[02:02:01]Look at my replay, bro. Look at my replay.

[02:02:04]Look at my replay, bro. Bro, zoom the hell in, you dumbass.

[02:02:11]Okay, bro. We're not even saying. But 5 kilometers in 3830, bro. Is that good or bad? Good or bad, bro? Let's go. I'm also a rookie, so it's nice. Only 5k, bro. Who does Praib think he is? Bro, Praib, I'm not even joking. You're going to pee yourself if you ever try to run even 1 kilometer run, bro. No, bro. I've run 6K uphill, [snorts] bro. So, is everybody better than me at DSA?

[02:02:38]Everybody better than me at running, bro? Am I trash at everything? I'm taking a challenge for myself running regularly since there's a 5k marathon here next month. Bro, a marathon is just five marathons are longer than 5k, right?

[02:02:52]Marathons are longer than 5k. What do you mean police? That's me who commented on LinkedIn. Hold on.

[02:02:59]Who are you talking about? Rohit Singh.

[02:03:01]Oh, you you're talking about Okay, I know who this guy's talking about. Rohit Singh. Okay, let's see.

[02:03:09]It was on Ad's post, right? Uh he's talking about this comment. This Yeah. Okay, this is you, bro. This is you.

[02:03:27]This is you, Rohit Singh. Let me show his comment, bro. Let me show his comment.

[02:03:33]I wrote I wrote Adish on Adish post because he's doing so good. I just wrote Bro needs to be studied and this guy replied Ro Singh. Then do a question hand emoji laughing emoji.

[02:03:52]Let's look at his profile now. Bro, this is you Rohit Singh brother. And he has removed his DP. He had his DP. I swear to God he had his DP when the last time I checked it. He removed it because he knew I'm going to check his profile today.

[02:04:09]Like bro, shut up.

[02:04:12]Shut up.

[02:04:14]He removed his DP just because I he knew that I'm going to look at his profile today.

[02:04:22]Yo, Electus, bro, where have you been?

[02:04:25]Where have you been, sir? Happy birthday. Happy birthday, sir. Electus, bro. It's a long time. The last time you came on stream, bro. How is life, bro? Happy birthday. Yes, bro. Rohit Singh, bro, you're so so smart. Just because you know I'm going to check your profile today. You removed your DP, bar.

[02:04:46]That's crazy. That's crazy. This guy removed DP just because I'm going to Let's look at his lead code then. Maybe let's look at his lead code.

[02:04:57]In fact, I I Hold on. Why is it not opening? Why is it not opening? Not opening.

[02:05:06]Not opening.

[02:05:09]Office.

[02:05:11]There's no time to do, bro. You can wake up on weekends. What are you talking about, bro? I mean, I do understand. I do understand, but you can do it on weekends, bro. What do you mean? Code lead on him, bro. His Did he ban me or what, bro? I can't open his I can't open this, bro. Okay, here it is. Code lead on him. Rohit Baba lead code U slash Rohit Baba.

[02:05:47]Is that him? Rohit minus Baba. Okay, let's check, bro. Okay, fair. 1,000 questions 1670 rating.

[02:05:59]Should we code lead on him? I don't think so. He would be cheating.

[02:06:06]N I mean fair bro at least bro doesn't copy paste bro doesn't copy paste that's good point but bro chill bro what are you doing in LinkedIn brother this is LinkedIn 500 problems that's not a number that's pure dedication love how you come chill chill chill chill bro chill day bro Look at Podis. He gives contest runs 5K as well as Goon. Exactly bro. We have been doing we have been giving contests losing rating. But I also ran a 5K. The first 5K of my life. I can't compete with the goat web. Oh, bro. You're my senior. Chill, bro.

[02:06:53]Chill.

[02:06:55]Relax. Late mornings and [ __ ] Bro, it is still you still woke up at 10. 10 is not late.

[02:07:03]Yeah.

[02:07:06]Fair, bro. Fair Rohit, bro. Fair. Fair bro. Best tuber. Best YouTuber. Real.

[02:07:12]Thank you, bro. How How did your contest go bro? How did your contest go? Aradhi Patel.

[02:07:21]Hold on, hold on. Arad Patel wants to learn how the tech work and want to contribute in it. Harat Patil a corny description but I've been see I'm seeing that you've been trying to stay consistent stay consistent bro why didn't you give today's contest what the hell are you doing Patel bro GLA University why didn't you give today's contest you got to keep giving the contests bro let's see if you're see just because bro's honest bros get a hold on is bro honest Merge closed characters.

[02:08:04]There was a large paste, bro. Oh, bro. I'm unfollowing this guy. This guy cheats. What the hell are you doing, Ard Patel, bro? What the hell are you doing?

[02:08:18]You do know I have code lead, right? And you're telling me to review your ID when you cheat?

[02:08:24]What the hell are you doing, bro? And he's laughing now. And he's laughing.

[02:08:29]Bro, why did you use two string in first discussion solution? Bro, s I was initially I was just doing percentage modulo 10 and then uh right shift by one. But for some reason it was not giving the right answers. So I was like I'm not going to debug. I'm just going to use two string. I'm just going to do two string. Purisha I follow you bro. So Rohit Singh bro Rohit Baba Rohit Baba. He followed me.

[02:09:02]Did he follow me, bro? Honestly, unfollow me, bro. We have a beef between us. I can't follow you, bro. Unfollow me. Unfollow me.

[02:09:12]No scribble today. Nah, bro. Scribble is too long. Scribble is too long. Scribble is too long. Right shift by one is for bitwise. So it's equivalent to Oh, I understood, bro. I Holy [ __ ] I was Why was I right shifting by one?

[02:09:31]It's not binary. Yeah, you're right, Sarth. I understood, bro. I understood.

[02:09:36]I understood. Okay, fair, bro. That's why it was wrong.

[02:09:41]That's why it was wrong. We have a beef between us. What are you laughing Praep, bro? What are you laughing? Check updated rankings, bro. Around 200 people got banned. 200 people got banned.

[02:09:54]Hold on. Did 200 people get banned?

[02:09:58]Weekly on this 506 ranking.

[02:10:03]Ranking.

[02:10:06]Yes, bro. This is what we like to see.

[02:10:09]Watch me win.

[02:10:12]Not enough activity detected in lead code editor.

[02:10:18]External paste.

[02:10:20]So, there's a 17 seconds external paste.

[02:10:25]Yeah, bro. Gary Casper. Okay, bro. 5.4K is a good rank. 5.4K is a good rank.

[02:10:31]Collab with a YouTube crush when bro.

[02:10:33]She's never She never replied, bro. This is like basic of bit manipulation. You don't know that, bro. I Jen, of course, I do know it. At that point of time, I was like, if I can convert it to string, why not just do it like that? I forgot.

[02:10:49]Bro, it was a silly mistake. Everybody does silly mistake. What do you mean?

[02:10:53]Dread, what's up, bro? How have you been? How have you been? How have you been, bro? This is like basic. Yeah, just chill. We will make sure she collabs with you. Don't worry, mate. We got Bro, please don't. Please don't. At this point, please don't, bro. Chill.

[02:11:07]Please don't. We We don't want to creep her out, bro. Please don't. Please.

[02:11:12]Please bro, let's just leave it, bro.

[02:11:15]Let's just leave it. Show your CF profile and review. Bro, I don't do CF.

[02:11:20]Hello, Pudish G. Dread, how have you been, bro? How have you been, bro? How have you been?

[02:11:26]It's been so long since, bro. Dread was last on my stream.

[02:11:33]Fair, bro. I think that's enough. That's enough, bro.

[02:11:40]Uh okay. Okay. Can you do code lead in an account? She just copies the answer. I know but I want to check.

[02:11:50]I want to check. Pradesh. Bro, you did not tell about your internship.

[02:11:54]What do you want to know about my internship?

[02:11:57]What do you want to know about my internship, bro?

[02:12:01]Bro, eight contests and 2,000 rating.

[02:12:05]Ridi won B 147. Holy [ __ ] It's all manual typing. Holy [ __ ] There are large pastes. Large paste detected, bro. Number of pairs. Rank 506.

[02:12:24]Rank 506.

[02:12:27]Where is she? Hold on.

[02:12:33]Hold on. Where is she? Did he be bro? We click on Did I click click on the correct one?

[02:12:44]She's not even on the rankings page, bro.

[02:12:50]What the hell? Did she get banned or what?

[02:12:55]Oh, she This is weekly contest 4991071B.

[02:13:05][music] Okay. So, she did maximum sum of alternating subdistances.

[02:13:13]I What is the question name, bro?

[02:13:16]Maximum sum. Okay. I think it was question three or question four maybe.

[02:13:24]Okay. It was question four.

[02:13:28]Question four. So, there was an external base in question four. Let's look at the code.

[02:13:37]Nah, bro. She's writing the code herself. If there was no external paste up until now, switch language, bro. It's all honesty. It's all honesty.

[02:13:48]We should apologize, chat.

[02:13:53]It's all Where is the Where is the external paste?

[02:13:58]But it's all honesty.

[02:14:06]Yeah, fair bro. Chill, bro. Chill. It's all honest.

[02:14:11]What got bit weird variable? Then it would have shown me, bro.

[02:14:15]Placement advice, bro. Dread, bro. Just chill the hell out. Chill the hell out.

[02:14:22]I a guardian and a CF expert and he's asking placement advice from me. But chill the hell out.

[02:14:30]Kurish I want to beat you anyhow bro I am 6'4 what are you talking about Rohit Singh bro I'll whoop your ass whenever I see you now brother people do look on GPD and then write code maybe bro we can't tell we can't tell we can't tell now she just types the answer I guess after she can't say anything for sure check mine not today there okay red what's your lead code and cf F bro it was augmented tech why you always get confused between 64 and 46 bro chill out chill out let's meet come on to come on to discord Rohit Singh if you have guts let's talk it out manto man come on to discord bro let's settle this beef let's talk it out manto man bro let's talk it out manto man Rohit bro if you have guts let's come on to discord let's talk it out right now Second question sliding window. Bro, even I thought sliding window but then I couldn't realize when to expand or contract.

[02:15:38]That's when I realized bro check this Aditi Prashad bro I need to sleep guys. Bro, last night I slept at I slept at 3:30, bro. 3:45 one day at a time. 53 followers. Bit misra.

[02:15:58]Damn.

[02:16:00]Damn.

[02:16:04]It's all manual typing, bro. What What are you guys trying to prove here?

[02:16:10]Oh, sorry. It's all manual. There's a small paste. A tiny bit of paste. Small small paste, bro. Small paste is acceptable. A tiny bit of paste. Do you want to see what the small paste was about? Where was it even?

[02:16:27]Bro, respect people who are honest. And this girl looks like she's honest. She deserves the respect. Sum of beautiful subsequences.

[02:16:38]What is the rank? 140.

[02:16:43]Beautiful subsequences. Bro, I need to add a feature in this code lead that it answers the question in orders.

[02:16:50]Aditi. Yes. There was a small paste, bro.

[02:16:57]Hold on.

[02:17:04]I mean, fair, bro. It's a small paste.

[02:17:09]It's just a Fen Victory. Uh, it's just the Fen Victory template, bro. Respect people who are good. Who are good, bro?

[02:17:18]I guess they can't believe because she's a girl. Yeah, bro. Stop being a sexist, bro. Stop being a sexist.

[02:17:23]Chill. Anyone did fourth? I got T. I got T. He Sak did. Sak did bro. Check mine.

[02:17:31]Not today. Bro, I know you don't cheat.

[02:17:33]I know you don't cheat. Are you CF expert, bro? I am a I'm a legendary grandmaster at CF. Does this face look like an expert at CF? Bro, I'm not even a knight at lead code. He's talking about CF expert. She cracked Amazon in turn. Of course, she she's going to crack Amazon in turn, bro. Of course.

[02:17:54]Sliding window is mostly for some monotonic property.

[02:17:58]Okay. Okay.

[02:18:01]Okay. The only thing I'm sliding is in girls DM. Look at this creep. Creepy, bro. What's your actual height, bro? I'm 6'4 in. Look at this.

[02:18:14]I'm 6'4 in, bro.

[02:18:17]I'm 6'4 in. You guys just don't want to believe me. What do I even say? I'm 6'4 in. Could have time for only three.

[02:18:25]Okay. Okay. It's six. It's not 6'4. It's 46. Okay, bro. Okay. I'm 6'4. I I used to play basketball and all that.

[02:18:38]Fair bro. See, Rohit is nowhere to be seen. That guy was like, I'm going to meet you. No, no, only physically. Yeah, because you don't have guts to talk it out like a man. Rohit, bro. Just chill out, bro. Just chill out when you have guts. I've given an open invitation.

[02:18:54]Let's talk it out manto man respectfully face to face over discord on live. Let's talk it out book. Let's end the beef.

[02:19:01]But you're scared now. What am I going to even say? That looks 56 max.

[02:19:07]You might be blind. You might be blind.

[02:19:10]Check one more ID X variant. Bro, if this ID is not a cheater, bro Krishna, I'm going to I'm going to ban you. Bro is giving me ID one after another and then he wants me to like I want to become proficient in DSA doing in CPP in parallel to CP learning webde a IML with great well he has done 64 contest nobody cheats in 64 contest bro the grind nobody cheats there are small pasts what the hell bro maybe he's writing in his code editor I think it was this fourth question, right? Yes. And his rank is 1 to 28.

[02:19:55]Hold on. Where is he? X variant. X variant. [music] He's not on the ranking page.

[02:20:09]What?

[02:20:13]Bro, did he get banned or what?

[02:20:16]Did he get banned or what?

[02:20:21]Sort wobbles by frequency.

[02:20:24]Sort wobbles by frequency. That sounds like an easy question.

[02:20:31]But how is my rank in every question?

[02:20:33]Valid elements in an array. I think it might be this question or maybe the second question then.

[02:20:41]Yes, second question. X variant.

[02:20:50]Okay, here is the second question.

[02:20:57]So broad wrote some code. Yes, fair.

[02:21:03]Respect the grinder. Where is even the external paste?

[02:21:11]So bro did some small external pasts.

[02:21:17]Why is his code not being highlighted?

[02:21:21]And then run code.

[02:21:24]Then there was a small external paste.

[02:21:34][singing] Hold on. Did we see something, bro? that we were not supposed to see.

[02:21:40]Did we see something?

[02:21:45]This emoji is right. This is our correct proof that this guy is using is using.

[02:21:52]Oh my god, we got the L. Yes, sir. Bro.

[02:21:55]Yes, sir. Yes, sir.

[02:21:58]Bro, 64 still can't get girls job personality.

[02:22:05]Okay, Anu MB, shut up. Shut up, bro.

[02:22:09]Stop singing this same song again.

[02:22:10]Again. Why, bro? Why? Why? Camera block.

[02:22:14]Oh, you guys couldn't see it. Hold on.

[02:22:16]Hold on. Now look what I was talking about. Look at this emojis, comments, and correct break. Like, bro, this is a pretty strong evidence that bro is cheating. That's what I want, bro. I mean, use GPT.

[02:22:31]That's what I'm trying to say.

[02:22:33]I'm looking question hold on hold on Rohit Singh bro I have done two all kills in my life and this guy bro why are you like trying to like humiliate you broit minus baba bro you're six like let's look at your performances 4k 5k Okay. 4K. Okay. Not bad. But bro, neither have you ever reached the fourth question. I've done on all kill twice. Bro, what are you talking about? I've done an all kill twice.

[02:23:15]Neither have you done a fourth question.

[02:23:19]So, just shut up. Just shut up. Rohit Singh really wants to smoke. Exactly, bro. Like, and he's scared to come on Discord, bro. Rohit Singh, let's just talk it out, bro. Let's talk it out.

[02:23:31]Let's just talk it out. Hello sir, I'm new to DS and I've started learning it.

[02:23:34]Sometimes I get confused about how to think things I could really want. Bro, emotional bro, stop spamming. Stop spamming.

[02:23:43]Why are you checking mine? I'm new, but I can beat you, bro. Just come on Discord, bro. Why are you not coming on Discord, bro? Why are you not coming on Discord? Is emotional.

[02:23:55]Chuk emotional, bro. Stop spamming.

[02:23:58]Message deleted by Austin. Richard, bro, stop spamming. Okay, I did want to view deleted message. If if we see what he wrote, I have just started learning it.

[02:24:07]Sometimes I get confused about while could you please give me some advice for beginners? How should I practice? Just keep on practicing. There's no correct way to practice. Practice is just practicing. That's it. Dubra, thank you bro. One v one Rohit in real life.

[02:24:23]He's very emotional. Okay, bro. Rohit is scared to even talk. Rohit, I live in a family and I don't abuse. Bro, who's telling to abuse, bro? We're going to just talk respectfully. Respectfully, bro. Respectfully. We're going to talk respectfully. There's no there's no abusers involved. Let's talk out what's the issue. Come on. Come on. Discord people. Let's sort it out. Would you, Rohit Singh, bro? Would you?

[02:24:49]Emotionally, you're at the wrong place.

[02:24:50]This person doesn't reply on DMs. Bro, shut your hell up. I have replied to you, bro. What are you even talking about? I've replied to you. I live in a family and I don't abuse, bro. Nobody's telling you to abuse. What are you thought? Is this going to be a clash?

[02:25:03]We're going to talk respectfully, man.

[02:25:05]Man, bro, just keeps spamming Yeezys.

[02:25:10]Who? Who are you talking about, Jassen?

[02:25:13]Who are you talking about? What's the issue with Rohit, bro? Rohit has an issue with me, bro. Not the other way around. Bro has an issue with me. I guess he's not coming. Change the title to beef with Baba.

[02:25:27]Fairly, bro. We literally talk every day, man.

[02:25:32]Shut up. Shut up.

[02:25:35]This guy is lying. Okay, it's 10:23. I'm I'm going to go sleep. Bye-bye.

[02:25:42]That Rohit guy. Exactly. Exactly, bro.

[02:25:45]Exactly. Depppel, what's up, Devopul?

[02:25:47]Bro, how have you been? I'm about to end the stream, but yeah, he doesn't even replies to my DMs. Praib, you don't even have my Instagram or my number. Where are you DMing me? Where are you DMing me? You liar. Do you guys have a community? Aditi Raj Purohit.

[02:26:07]We do have a discord server. We do have a discord server wherein we are pretty active. Sleep then sleep brother. Sleep.

[02:26:16]Join my discord. So that's it for this stream. Roit is not Rohit is scared and he's not going to hop on Discord. So that's it.

[02:26:32]Okay. Both goddesses both the I'm ending the stream. These people are so creepy.

[02:26:41]That's it for the stream. [laughter] Let's meet in the next stream. Bye-bye.