Leetcode Weekly Contest 504 | @ss performance like usual

Hinzugefügt: 2026-06-01

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

[00:00:40]Hi, bro. Hello, bro. Hello.

[00:00:43]What's up? Good morning.

[00:00:46]Good morning to everybody.

[00:00:50]But I'm so sleepy today, bro. See, I'm waiting for you, man.

[00:00:57]We are here, bro.

[00:01:00]I was also so sleepy, bro.

[00:01:04]Let's try to finish it early so that we can go back to sleep.

[00:01:10]Good biceps. Thanks, bro.

[00:01:14]Let's set [ __ ] up.

[00:01:18]Nope. It's a good contest, bro. God, this contest, bro. I've I've had really bad contest at this point. God, please keep this as a good contest for me.

[00:01:30]We have one minute.

[00:01:39]Moments before disaster. What? Sh 9752.

[00:01:45]Bro, speak positive, bro. Please. Congo in advance for night by n. Nah, please.

[00:01:53]Let it happen first. Let it happen.

[00:01:59]I'm so sleepy, bro. I don't think so.

[00:02:00]gaining that badge today.

[00:02:10]Good luck, bro. Good luck to everybody.

[00:02:17]You got 10 seconds.

[00:02:28]Later. Continue.

[00:02:35]frequency.

[00:02:40]Give it a score of L is the sum of B star frequency B.

[00:02:57]All this is the frequency.

[00:03:54]And for I equal 0 I less than uh this 11 of J equals to S of I F + answer plus equals to S of I minus 0.

[00:05:19]Done. Insert five.

[00:05:30]two.

[00:05:32]Now, bro, this still looks like a tough question.

[00:05:40]This was 2 into 24.

[00:05:46]Yeah, I think it should work here.

[00:05:57]Max number of items from sale given a two integer array items represent the item you're also given an integer budget. There are unlimited copies of each item available for purchase. You may buy any number of copies of any items such as that total cost of purchase copies.

[00:06:23]You may buy any number of copies of any items. After buying items, you may receive free copies according to the following rule. For each item I that you bought at least one copy of, you can receive one free copy of every item J such that it's different. And factor I divide factor J factor I factor J. Okay. So the new factor is a multiple of the factor I. Buying multiple copies of same item I does not give additional free copies through item I. Okay. The same item J can be received multiple times for free if it is received from purchases of different the maximum total number of item copies you can obtain including both purchase copies and free copies while spending at most.

[00:07:22]You can buy two copies. What is the length here? It's just thousand. It's just thousand web. Remember that. It's just [ __ ] thousand. Please remember that.

[00:07:44]Uh factor which is the multiple of I then you can buy that one.

[00:08:11]We'll buy two copies of item 0 and one.

[00:08:17]It's factor, price and budget is nine. 8 4 two copies of item zero and one copy of item two. Okay. Eight.

[00:08:40]Okay, fair, fair, fair.

[00:08:46]Buying item two gives you one free copy of item zero because factor two divides factor three. Uh, maximum total number of item copies you can obtain including both purchase copies and precopy.

[00:08:59]Okay. So I'm trying to figure out the approach.

[00:09:08]So we want to find the max number of copies.

[00:09:39]max number of copies.

[00:09:42]We want to stay in budget after we bought copies. We want the three copies to that. We want that current actor has multiples in our multiples in our array six.

[00:10:19]Buying item two gives you one because factor two 3 divides factor 06. Fair.

[00:10:26]Oh, okay.

[00:10:34]This looks like a DP question, bro.

[00:10:40]Looks like a DP question.

[00:10:49]You know what?

[00:10:51]You know what's the best way to do it?

[00:10:54]Brute force the [ __ ] out of it. Brute force the [ __ ] out of it.

[00:11:30]in CF equals to uh current factor equals to items I zero. Okay.

[00:11:44]J less than N J+ if I = to J. Continue.

[00:12:04]H we'll continue. Uh if items J 0 is percentage items percentage CF uh buying item two gives you because factor 2 uh then we can just say free copy for if item equals to true and make it Okay, let me break it.

[00:12:39]This tells us which gives us free copy or not.

[00:12:47]H.

[00:12:49]Now we don't care about the factors thing is out of Yep. The factors thing is out of practice is out of No, it's about Okay, you now you can try to buy copies and stay under budget.

[00:13:59]Okay. And you cannot get additional copies of uh Bro, there's just too many [ __ ] variables there. You cannot get additional copies.

[00:14:50]We want to find the we want to find budget after we bought copies. We want the free copies too. For that we take three copies to we just have yeah we've created another array. Now the point is we want to what do we calculate this ship?

[00:15:11]How do we pick up?

[00:15:17]We want the paid as max books equals to copies plus free equals to paid plus free.

[00:15:47]Oh, okay. So, if we can buy these, we don't care. We don't care about we can buy two paid All these uh factors if you can buy two we always buy it bro I'm over complicating it web up again just just focus just focus Huh?

[00:17:02]I think I need to write a DP in here. I don't know. End solver that takes in your this items [ __ ] H probably. Yep.

[00:17:28]Vector B.

[00:17:34]Vector B. Free copies.

[00:17:54]Yeah.

[00:18:05]sorting boolean CP brill out.

[00:18:15]False is treated as zero.

[00:18:20]Okay.

[00:18:27]free copies and ptr.

[00:18:35]Uh if ptr is equals to items dot size you return zero. Now can buy current book can skip current book.

[00:19:01]Oh, we also need to have the budget in PTR and spend in budget.

[00:19:21]At most budget if spend is greater than budget can buy.

[00:19:42]See if budget allows what the [ __ ] for each item that you got. Buying multiple copies of same item I does not give additional free copies through item I fair.

[00:20:23]So if we think about it, we would always go with the smallest item first by its maximum copies.

[00:20:38]Right.

[00:20:47]Hold up. Hold up.

[00:20:55]H I think. Yeah, just go with the smallest item.

[00:21:04]Okay.

[00:21:06]Small item that has a one.

[00:21:25]does not give the same item. They can be received multiple times for free if it is rich.

[00:21:57]Uh uh now two books of the same price.

[00:22:08]Yep. The only issue here is let's say your budget is nine and you have two books of budget eight and nine.

[00:22:17]Eight does not give you free copy but nine. Does you want to get nine? Then you want to get nine.

[00:22:38]Factor price.

[00:22:45]free copies. No, bro. This [ __ ] is bro.

[00:23:12]Okay, I need to stay calm. I need to stay calm, bro.

[00:23:16]Maybe just create an array. Vector in taken. Okay, you create an array. Now see what it allows. save.

[00:23:30]We can have this free copy as a free copy dot resize and comma false.

[00:23:43]We can have this as a globally declared array.

[00:23:48]Okay, fair.

[00:23:51]Keep this as vector bool free copy.

[00:23:56]Now see if budget allows int cost equals to items ptr and uh the budget is factor is one.

[00:24:09]Okay. Now if you cannot buy it then you simply if and only if Max between two vectors.

[00:24:50]compare vectors size.

[00:25:02]Okay, it's just a size function. It's just a sex function.

[00:25:28]So whenever you buy an eligible notebook, we don't care.

[00:25:38]H we also need to Yeah, we also need to take care.

[00:25:44]I don't think so. So I think this can be solved using greedy.

[00:25:52]Can this be solved using greedy three copies? Please paid no free. No free.

[00:26:29]Or maybe if you can just distribute them and then get compare every time you're buying something.

[00:26:42]Maybe if then we'll have pointer one, pointer two spend.

[00:26:51]Oh, that might be a bit too much.

[00:27:15]broke three copies. So item so you so it pivots. If you can buy multiple copies then you don't care about buying that free copy [ __ ] and all.

[00:27:38]Of course, if if you can buy it, point is like one.

[00:27:50]Yep. Yep. Yep. Yep. Yep. Yep.

[00:27:58]Vector in taken.

[00:28:17]bro this question is not easy bro is second one DP exactly bro it looks like DP bro it looks like DP but it's not Easy.

[00:28:32]It's not easy, bro. I'm trying to DP. It just have It just has too many variables. You bought at least one copy.

[00:28:39]You receive one free copy of every item.

[00:28:41]J buy multiple copies of same item. I does not give additional copies.

[00:28:51]So, what you want is okay. Let's try to like think of something here.

[00:28:59]value. We want number hold on we want number to be max number to be matched. This is not binary search, bro. There's no way this is binary search though. No, this is not.

[00:29:30]How do we invalidate?

[00:29:32]That's the entire point of it. How do we validate?

[00:29:39]We want number of copies to be maxed.

[00:29:45]We can buy copies under budget.

[00:29:54]When we buy type one copies, it gives us bro. It's about you need to have a pointer. You need to have a spend.

[00:30:22]You also need to have uh end type one.

[00:30:33]But yeah, Bro, it's got [ __ ] I think bro, this might give us an Emily.

[00:31:02]What would be a pointer goes from 0 to,000, right? Spend goes from 0 to,500.

[00:31:11]That's still fair. And the vector would goes from 0 to,000.

[00:31:19]Bro, this might give us a Emily or something.

[00:31:30]Okay, let's hope. Let's hope if cost is less than if cost plus spent is less than equals to budget only. Then you can try to buy can buy and skip.

[00:31:57]Right. What you can do is now in the can by part.

[00:32:12]See if already bought.

[00:32:17]If bro this can be this can give us that's the point. If uh taken of ptr equals to equals to 1 then you you just surplus equals to 1 if you already taken it. answer plus equals to 1. And you can say spend plus = to 1 + solver. Now items would remain the same. Taken remains the same. Pointer + one.

[00:33:20]Okay.

[00:33:23]See if already bought.

[00:33:30]Int move equals to 1 + solver pointer + 1 spend plus cost, budget remains the same.

[00:33:40]Budget remains the same. End stay equals to 1 + solver. Items taken remains the same. Pointer remains the same. Spent remains the same.

[00:33:54]And spend remains the same.

[00:34:10]Yeah, we have two types of copy. One that gives us one extra, two that does not give us one extra.

[00:34:20]Type one. Type two.

[00:34:22]H.

[00:34:26]That is not Yep.

[00:34:43]We want the smallest budget and something that gives us free. Smallest budget and something that gives us free.

[00:34:58]Bro, this [ __ ] is [ __ ] me. I'm never getting my night badge, bro. And the third question is just better part of this, right?

[00:35:07]Bro, this is stupid. Spend would be spent plus cost and budget.

[00:35:14]Bro, honestly a good question though. It is a good question. And then answer equals to max between move, stay t if it was already bought.

[00:35:31]If never bought, else taken of PTR equals to 1.

[00:35:51]Int= to free copy of PTR.

[00:35:58]Free copy of ptr true here. If that is true to one else zero. Okay.

[00:36:07]Fair.

[00:36:08]Fair.

[00:36:10]Now the same [ __ ] This time we just have a two add variable.

[00:36:17]Bro is this would this actually need DP, bro?

[00:36:33]This is if you're buying can buy can skip equals to max between move and stay.

[00:36:57]Then again answer equal to max between move and stay. And then here skip. Skip would basically be skip would basically be in skip equals to skip.

[00:37:25]Skip is basically see if already bought, if never bought.

[00:37:42]Can we make vector of set np sync?

[00:38:01]That might reduce the size though. But yeah, I'm not really sure.

[00:38:07]Not really sure. Let's just try doing it. Oh, this is going to give us an MLE.

[00:38:11]No, this is Let me just try doing it.

[00:38:14]Solver between our items taken remains the same. PTR + one.

[00:38:27]Okay, do the skip one first because you don't want any manipulation in taken, bro.

[00:38:37]Do the skip one first. Okay. Taken pointer + one. Bro, these questions are [ __ ] mean ass. Spend remains the same. Budget remains the same. Budget remains the same. Answer equals to max.

[00:38:55]A stupid ass.

[00:39:13]Okay. Answer equals to max between answer comma skip. Okay. Answer comma skip. And in the end you just return answer what in the end this return bro this question is crazy crazy question bro set.

[00:40:10]That is if else you only skip. Else you just skip, right?

[00:40:18]Skip.

[00:40:25]can skip return answer. Let's see all word for items and taken vector in taken taken of size n comma 0 taken and you want pointer as zero and you want spent as zero and budget remain that return answer.

[00:41:11]Well, this is not how is it supposed to be solved. What items we're getting four for first one, nine for second.

[00:41:30]How the [ __ ] are we getting nine, bro?

[00:41:39]You can buy one copy of item zero, one copy of item one, and two copies of item two.

[00:41:47]Buying item zero gives one free copy of item 2 3 4.

[00:41:59]How did you buying item zero gives one free copy of 2, three, four?

[00:42:04]Oh, bro, I was What the [ __ ] Oh my god, bro. This [ __ ] is insane.

[00:42:14]This [ __ ] is absolutely insane.

[00:42:22]One cup of item zero.

[00:42:27]Bro, this [ __ ] is absolutely insane.

[00:42:29]Okay. Okay. This [ __ ] is absolutely What the [ __ ] Vector keep a vector in dep equals to zero.

[00:42:56]Now you can just say free copy for current I equals to FC.

[00:43:06]God damn bro.

[00:43:13]Okay. Now in here uh taken Free copy of DDR zero.

[00:43:43]I should I try submitting this by memorizing it?

[00:43:53]What's the best way to track if we have taken it or not?

[00:43:59]Yeah, I don't think so. I Let me just try memorizing this. Who knows? This might work because the constraints are small.

[00:44:06]So, we'll make a DP of taken ptr spent 3D DP with a vector. What the [ __ ] bro?

[00:44:23]DP vector the first dimension is vector of Wait, I'm confused. How How do I even make this?

[00:44:43]But this [ __ ] would not work.

[00:44:56]And and this wouldn't work without memorization, right?

[00:45:02]Bro, this question is vector taken pointer.

[00:45:36]If I submit this, I'll get a TLE because I have not memorized this. Four, five, 4.5k people have done it. Bro, I don't understand how this world works, bro. I don't This is not an easy question, bro.

[00:45:51]Let's be honest.

[00:45:54]4.5K people have done it. Am I missing something? Am I missing something?

[00:46:01]So we want to treat a track cap.

[00:46:15]So you want we want to keep a track of which copy we have bought. Okay. For that I was keeping a vector vector of vector with dimensions vector in in cp.

[00:46:43]You see I that does not even exist.

[00:46:58]Vector of end, bro. That does not like how do I memorize this? The code is working.

[00:47:27]It's all about what if I just create an unorded map of vector and bro would that work?

[00:47:59]map of pair of vector hash.

[00:48:36]Now what you can do is keep it keep it global, bro.

[00:48:44]Or maybe not global.

[00:48:46]Doesn't matter.

[00:48:48]Doesn't matter. Just include it in the Yeah, fair.

[00:48:57]Just keep it here. Okay.

[00:49:02]String s equals to two string ptr plus. Bro, this is not how it's done, bro. Two string budget jet.

[00:49:17]If hash of taken, comma s dot find.

[00:49:33]No, no, no, no. Hash dot find is not equals to hash.

[00:49:46]return hash of taken comma s.

[00:49:55]In the end you just do hash of taken comma s equals to answer.

[00:50:13]What expected?

[00:50:26]What the hell?

[00:50:32]Not too much.

[00:50:37]What the hell?

[00:50:42]Oh, okay. Okay. Okay. Okay.

[00:50:53]Return 99.

[00:51:02]What is this error that I'm getting?

[00:51:05]What is this error that I'm getting, bro? Barrow vector in string.

[00:51:26]Bro, is this is is there something wrong with what I've typed?

[00:51:37]Oh, okay.

[00:51:46]Custom hash and equals to, bro. I actually don't care.

[00:51:57]So if unorded map doesn't exist, if we can use map, right? Map in CPP.

[00:52:08]We can use map in CPP.

[00:52:14]Yep, I think maybe map would work.

[00:52:34]Yeah, bro.

[00:52:36]Four and 10 pair of vector int comma string and int.

[00:52:50]Is this correct? Is this is this correct syntax?

[00:53:07]Bro, I mean learn third Emily. Second is DP, bro.

[00:53:32]I don't know how do you guys do it. 5.6K people have done it already. At this point, it's a tradition, bro. It's a tradition that I get my ass whooped by the second question.

[00:53:44]It's a goddamn tradition.

[00:54:01]The only issue here is and the next question is this is just the second part of it, right?

[00:54:14]Maximum items for sale to [ __ ] Absolute [ __ ] Lead code.

[00:54:22]So you want what you want to do is you can buy or not buy an item.

[00:54:28]Okay.

[00:54:37]Yeah. And what what scale do you decide if you don't buy them?

[00:54:44]Why is my hashing not working for some reason?

[00:54:59]For some reason, my hashing is not working.

[00:55:21]What the [ __ ] Why is my hash not working, bro? That is insane.

[00:55:30]10 and 22.

[00:55:35]See old phone hashing 29 29 29 29 1 9 29 basically means Your pointer is two and budget is nine.

[00:56:17]Budget is nine is left right. Start with 10.

[00:56:49]Turning hash of taken, comma This what the hell? It's working now.

[00:57:20]22. Why output is 10?

[00:57:29]In the second one, the output.

[00:57:32]Okay. In the first one, it should be four. The second.

[00:57:41]Oh, stupid ass. Stupid ass. Stupid ass.

[00:57:49]Four and 10.

[00:57:52]But I'm pretty sure this would not work, bro. Let's at least try to get our first first attempt. Bro, I think this would get get us a T or MLE or something.

[00:58:04]T or MLE or something. What if we have a test case? Yeah, I don't even know. Just let's try submitting.

[00:58:11]It's going to give us MLE T something.

[00:58:17]Gave us a wrong answer.

[00:58:19]624 output 18 expected 17.

[00:58:24]And I can't even debug this. I can't even debug this [ __ ] bro.

[00:58:33]I can't even debug this [ __ ] Skip is Yeah, I can't debug this.

[00:58:56]Spend taken spend budget remains the same.

[00:59:07]Bro, we cooked, bro.

[00:59:10]The [ __ ] is this question?

[00:59:15]Question three is nuclear bomba, bro. So many question.

[00:59:26]But that's Wow, bro. It's 1500 loading, man.

[00:59:34]Bro. Yes, bro. You [ __ ] the fact that he's not even wrong.

[00:59:41]He's not even wrong, bro. I don't think so we will create a map with a vector as key. There's no way we're going to do that. There's no way we need to do that.

[00:59:52]Okay, think web. Think again. Try thinking again. Stay calm, bro. You're used to losing rating. Just think what is the logic behind the question.

[01:00:05]The point is you don't know which one to buy.

[01:00:28]Whenever you buy an old book, no matter if you buy one or two Hold up, hold up, hold up, hold up, hold, hold up. No, no, no. Don't hold up, bro.

[01:00:43]I I'm not cooking. I'm not cooking. I thought maybe I got something, but no.

[01:00:50]What? No.

[01:00:59]But no, I thought maybe I got something. Bro, the point is the budget is 1,500.

[01:01:13]6.4K people have done it.

[01:01:19]Pura Absol man everything will be fine.

[01:01:25]Yeah, bro.

[01:01:28]Virat Katya, chill.

[01:01:42]It's about doesn't matter.

[01:01:49]That is the point. It all matters. Did you take it or not? Did you take it or not?

[01:02:03]Did you take it or not? I think one way to do it is is you can either skip it or by one. Okay, there might be one way to do it. If like we don't need this taken vector variable. Okay, we don't need this taken vector variable pointer and spent. If I write the logic logic again, bro, if I write the logic again, first of all, if spent is greater than equals to budget or all ptr equals to items items do size, then you return zero. That's it. Okay. Now, how many can you buy the how many of the current notebook can you buy based on the current budget? Find cost equals to items of I think max by equals to cost divide uh spend uh budget minus spend.

[01:03:29]I just have a budget left, bro. What the [ __ ] are you doing? Budget left.

[01:03:38]Budget left.

[01:03:43]budget budget by uh cost. Okay, this would give us the yeah like 8 by 9 by 2 is uh four H. So for int i = 1, I less than max by i ++.

[01:04:09]Okay, one is skip. One option is skip.

[01:04:13]Int skip equals to uh solver of Bro, I think this is better, bro. And then you can have answer equals to max between answer, comma, skip. Okay. Now for maximum buy what you do is uh int spent equals to cost star I cost star I then uh int temp would be would be free copy of I free copy of of not I of pointer plus 1 plus I less than equals to max plus solver of items pointer plus one budget minus pen. So this time we are forcing that if you're Yeah. Yep. Yep.

[01:05:26]And answer equals to max between answer, 10 return. Let's hope return answer right free items items pointer zero and budget budget I think I simplified it a lot. I need to I still need to memorize it but I did simplify it I think.

[01:06:03]Right. I think I did simplify it. Let's hope it works here at least. What spend?

[01:06:09]Sorry. Oh, if budget budget equals equals to zero or items I sorry ptr. Bro, this is hold on.

[01:06:28]I'm I'm happy as of right now. I'm happy with this approach. Six and eight. You son of a [ __ ] Six and eight.

[01:06:47]You can buy four copies of two. Okay.

[01:06:51]You can buy four copies of two.

[01:06:58]Free copy of ptr plus i plus sol.

[01:07:09]Let's see if max y is working correctly.

[01:07:11]Bro, max by equals to uh max by When budget equals to budget max= to 3 when budget equals to 9 cost equals to Cost co cost equals to 3 max y equ= to 3 3's are 2 4 3 2's are 6 3 1 are 3 3 1 are three 3 0 fair fair I less than equals to max by i ++ int spent equals to current cost into I budget minus spent budget free copy plus I plus solver. Bro, I still don't understand how is this not working. This is the cleanest solution I've ever written. Bro, the cleanest solution. We are buying free copy of pointer free copy logic budget equals to 8.

[01:08:44]Hold on. Okay. Raja cost to b one cost to bro. I'm not hand.

[01:08:51]So we getting 10. We getting four. Okay.

[01:08:54]Okay. Okay. Okay. Okay. Hold on. Hold on. Hold on. Now to memorize this, we just need pointer and budget. To memorize this, we just need pointer and budget.

[01:09:07]Vector vector in DP and pointer and budget. We just need ptr and budget. So dp res size initially anchor for vector int which is going to go from budget which is going to go till budget and let's just do budget jet + one and initially sub minus one. Okay.

[01:09:41]Now if dp of ptr and budget is not equals to minus1 return dp of ptr and budget budget yep of ptr and budget equals to answer hold on let's hope this works bro 4 and 10 is that what they wanted 4 and 10 correct in Here we're getting 17.

[01:10:18]Oh, hold on. Hold on. Bro, I What? What am I celebrating, bro? It's not submitted yet. Shut the [ __ ] up. It's not submitted yet. 17, 10, and four.

[01:11:08]Well, I genuinely Yeah, I'm I'm feeling this contest, bro.

[01:11:15]I am feeling this contest.

[01:11:19]I'm feeling this contest, bro.

[01:11:23]Bro, I'm feeling this contest. I was so happy with this approach, bro.

[01:11:28]Bro, when does the stream starts?

[01:11:31]The [ __ ] Yes, bro. Are you like mentally okay, brother? Are you [ __ ] mentally okay, bro? Don't piss me off when I can't solve the second question in the contest, brother.

[01:11:43]Minus 20.

[01:11:46]These [ __ ] are lead code, bro. [ __ ] them, bro. These [ __ ] Budget minus spin.

[01:11:57]We got a TLE, bro. How do I optimize this further? Are you Are we [ __ ] serious? Are we serious? How do I optimize this further?

[01:12:24]Maybe if I just I don't even know.

[01:12:40]Bro, this question has [ __ ] me in the ass.

[01:12:45]The question be 6K minus 20. I'm getting minus 20. Did you loop? Did you lose use loop inside function? Yes, sir. Bro, I don't see any approach how we don't use it.

[01:13:00]I think bottom up will work, bro. How the hell would it work? How the hell would bottom up work?

[01:13:13]Like, what even is bottom up in here, bro? This [ __ ] is a [ __ ] pick or not pick.

[01:13:23]Yeah, I don't think so. I'm solving this. I genuinely think this was the best approach I had. The code I've written is clean. Super clean code, bro.

[01:13:32]I don't think so. I I have anything left to beat this question's ass.

[01:13:44]I'm pretty sure it is like 1111.

[01:13:47]This expected output is 1111. I'm pretty sure, bro.

[01:13:53]I'm pretty sure the entire question is if you can buy a copy eight times, you can also buy it zero times.

[01:14:08]Are there any cases where we'll buy it four times or five times or three times or two times? That's what I'm checking.

[01:14:14]But that is giving me TLE that if I can buy the maximum copies that I can buy for a current copy is let's say eight. So then I'm checking for every case zero if I what if I bought zero copies one copy second copy three copies four copies of that copy.

[01:14:33]But I feel like that's Bro, bro, [ __ ] this [ __ ] bro. We don't care, bro. We We are learning Golang. [ __ ] lead code. [ __ ] lead code, bro. We learning Golang, bro. Golang is better than lead code, bro. You can change that loop thing.

[01:14:52]Please show your code, bro. Kai Roxson, brother, contest is going on. We can't show it as code.

[01:15:00]Did it like fractional naps? Nav knapsack.

[01:15:06]It's just unbounded napsack.

[01:15:10]Why? I've not done like unbounded napsack. I need to do DP better, bro. I need to do DP better.

[01:15:18]I need to do DP better. Greedily pick the minimum prize item first in question. Do DP on that. Spread that logic. Yeah.

[01:15:26]Which year are you in, stupid coder, bro? I have graduated.

[01:15:33]I've graduated TLE 5 757 out of 764. Yes, brother. How much? 757. I also got 757.

[01:15:56]I don't know how to [ __ ] solve this.

[01:15:59]7.3K people have done this. That makes me feel like an absolutely like a stupid [ __ ] kid, bro. 7.3K people have done a question and I can't I'm getting a T.

[01:16:12]I'm getting a T, bro.

[01:16:15]You know what? I don't care, bro. I'm learning Go. Learning Go is much more fun than [ __ ] my head with lead code.

[01:16:21]I'll be honest, bro. Learning Golang is 100 times more fun writing programs in Golang, bro. Thank god I'm I've reduced doing lead code. This [ __ ] is not for me. 7.8,000 people in the entire world have done this and I'm getting a T.

[01:16:38]I'm getting a T. Fair. Fair. Fair.

[01:16:43]I thought I wrote a very pretty code, but no.

[01:16:49]No. No. No. No.

[01:17:01]No, no, no, no, no.

[01:17:15]I'm 100% sure this is an [ __ ] test case with some ones or one lakhs in it.

[01:17:23]This is that [ __ ] test case. [ __ ] test case. No way. Yeah, try contributing to open source something like indie dev thing. Yeah, bro. That's what I plan to do, bro. [ __ ] [ __ ] lead code. It's not for me. I'm not made for lead code, bro. I did memorization. It worked. Sashi, bro. Congratulations.

[01:17:41]Congratulations.

[01:17:42]Yeah, but my plan is, bro, I need to get away from lead code. This [ __ ] is not for me. I just saw third.

[01:17:49]Was happy that I'll get under 2K rank.

[01:17:51]Then I can then I saw 2k plus people sold fourth max 2,000 people sold fourth.

[01:18:08]What is my rank? Let's be a man and look at my rank. 12,000. Congratulations, brother. You deserve that. You deserve every bit of that. 12,000.

[01:18:19]Congratulations.

[01:18:20]Fractional DP, fractional knapsack. I don't even know what the [ __ ] is that. I just know that napsack is pick or not pick. That's it. Pick or not pick.

[01:18:31]That's it.

[01:18:37]Pick or not pick.

[01:18:40]Fractional is basically pick up part of it.

[01:18:44]I don't know. We give up. We give up.

[01:18:48]That ball thumbnail of your resembles bald KSI. Not going to lie, bro. Shut up.

[01:18:54]All this forgative 20.

[01:19:00]Yeah, bro. Yeah.

[01:19:07]India.

[01:19:09]Who's going to reach Guardian with this performance? Praep. The the shameless guy, bro. Praep, the shameless guy. Praep, this [ __ ] is not worth remaining my worth my remaining hair strands.

[01:19:26]You want to see mine?

[01:19:33]Beauty as [ __ ] Try applying one more condition in napstack. I guess it'll work.

[01:19:44]What more one more condition in navsack basically how much you're picking that condition is basically that how much you're picking.

[01:20:02]Yeah.

[01:20:07]Oh, okay.

[01:20:09]Maybe in in my current DP hold on in my current DB itself I can add another parameter.

[01:20:28]No.

[01:20:48]Okay. So maybe if I can translate that the number of books I'm buying that also goes into the parameters.

[01:20:55]That also goes into the parameters.

[01:21:00]Then h if if I just get move that thing that how many books am I buying that also goes into the parameters then how would that work right now it's pointer and budget how would that book.

[01:21:27]I'll have to change my inner logic.

[01:21:36]If I just do in copies in here. Okay.

[01:21:40]And in the end, this copies become my DP budget of copies.

[01:21:59]Okay. Items.length and price can go up to 1500. So this copy [ __ ] will go up till 1500. Vector of end.

[01:22:09]Okay.

[01:22:12]Spend deny is how many copies we are buying.

[01:22:17]Okay.

[01:22:19]Now uh where is DBR resize and another thing would be vector of int which is going to be of size at max.

[01:22:42]Let's just say let's just say 1,500 and initially minus one. Is that going to give us a MLE?

[01:22:52]Is that going to give us an Emily?

[01:22:54]Return DP budget copies DP budget zero. Here the copies would be zero.

[01:23:12]Now, what the hell? Yeah, let me let's just do zero in here, bro.

[01:23:32]4 10 17 Hold on.

[01:23:40]Hold on.

[01:23:42]Hold on, bro.

[01:23:44]Should I try submitting it? 4 1017. It might give me a ML or something.

[01:23:57]Okay, we we if we want we can Why did my extension not work in here?

[01:24:03]int max copies would be budget smallest val equals to int max. And we can just say equals to min between smallest vala comma items of i comma 1. Okay. Now int max copies.

[01:24:53]Max copies equals to budget by smallest valves.

[01:25:10]Heat buffer overflow.

[01:25:14]Sorry. Sorry. Sorry. Sorry.

[01:25:23]Let's try submitting it now.

[01:25:29]Yeah. [ __ ] me. [ __ ] me. Yes, sir. [ __ ] me.

[01:25:35][ __ ] me. Lead code.

[01:25:38]We have pointer. We need to We can't get rid of pointer. We can't get rid of budget. We can't get rid of copies.

[01:25:47]He can't.

[01:25:56]We getting today. My rank is 21k. Yo, Kamish, my brother. See, you you will get a lot of people that congratulate you when you're at your peak. But when you're losing rating and if your bro is also lo losing rating, that's when you realize that he's your real brother. Kavesh, brother, love you, brother. Thank you for losing rating just because I'm losing rating.

[01:26:25]Bottom up solved. Emily, start with that again. Yashkupta is [ __ ] rage baiting me at this point, bro. I'm going to beat his ass. He's telling me to start with that.

[01:26:41]I'll give you hint for a second there.

[01:26:42]You will buy all the items only once and at the end buy minimum cost items with all the remaining budget.

[01:26:51]I don't even care. Bro, Praep brother first of all tell me how the hell do you study? 9K people have solved this. Is this even possible? It's like extreme to extreme cheating. I don't even know how how do people do it. 9K people have solved the second question.

[01:27:08]I'm seeing a question like that for the first time. Maybe I've not done enough DSA, but 9,000 people have solved that.

[01:27:14]Bro, wasn't one zero DP though. Or is it greedy? I don't care. But sure. Yeah, it's it's pick or not pick, but people are saying it's fractional DP or something, bro.

[01:27:30]It shouldn't be more than 500 people that should solve this.

[01:27:45]solve POD.

[01:27:47]Yeah, people it requires factor storage and some level of maths, bro. Let's just look at POTD, bro.

[01:27:56][ __ ] you.

[01:27:58]We might just do Golang after this, bro.

[01:28:00]I don't care about this [ __ ] Look at my rank, bro. Look at my rank. 12k rank.

[01:28:09]12k rank. You [ __ ] off. Let's just look at the beauty reo destroying asteroids.

[01:28:20]Another medium. Not even going to look at it. What was the rating?

[01:28:25]What was the rating?

[01:28:31]Tell me the rating. 1300. Okay. It looks easy. You're given an integer mass which represents the original mass of a planet you further given.

[01:28:43]You can arrange the planet supply with asteroids at any if the mass of the planet is greater than or equals to the asteroid is destroyed and the planet gets otherwise done true if all asteroids can be destroyed.

[01:28:56]So just so so just sort the asteroids in smaller orders in like sort the asteroids value.

[01:29:07]What the hell, bro?

[01:29:11]What the hell?

[01:29:14]Bro, what the hell? Why don't questions like these come up in contest, bro? Why don't question like these come up in contest?

[01:29:28]begin comma end.

[01:29:31]Now uh for i =0 y less than L of air r if L is greater than mass return false mass plus equals to L return true. Is is this the question or did I misunderstand it?

[01:30:02]Is this the question, bro? Be honest with me.

[01:30:07]Is this the question? Runtime error. And we got a TLE sign integer overflow, bro.

[01:30:20]Long long long T equals to mass T.

[01:30:31]These [ __ ] made sure that nobody can get it in the first attempt. Bro, these [ __ ] made sure that nobody can get it in the first attempt.

[01:30:44]Did I show my code? Doesn't matter. My code doesn't even work. My code doesn't even work. I'm getting T in question too. It's Arpit. Congratulations. You're just like the hund other people in this chat.

[01:30:55]Ka. Nah, bro. Nah. Nah, bro. Easier today. Pe just 40 minutes for first question. Woke up late. Yeah, probably woke up late.

[01:31:08]They contest negative. I know. Second question.

[01:31:15]It's simple. Skip take. Okay. What is Mr. 4921 saying? It's simple. Skip.

[01:31:23]Skip. Take states minus index. Remaining budget.

[01:31:29]What is states minus index, bro? What is states minus index? Not going to lie, today's contest was easy as [ __ ] bro.

[01:31:37]Brother. Brother.

[01:31:40]This guy is saying today's contest was easy.

[01:31:45]Yeah, he's trying to rage bait. I'm not even going to fall for it. Yeah. Yeah, it was easy. Very easy, brother. Very easy. Remove this annoying translate thing. But I need to check some settings. How do I even remove it? I don't know. Scribble, brother. Scribble.

[01:32:00]Are we serious? You guys want to play Scribble after this segment? I know brother. Index budget free taken. Okay. Akanit is saying free taken. Index and budget fair. But what is free taken in here?

[01:32:22]Free taken.

[01:32:24]Free taken.

[01:32:29]I don't know bro. Dude that second was do DP on each items once so that we can get all the free copies with max remaining budget. Then with remaining budget we get max possible items which hold on hold on bro J is probably cooking. Do the second was do DP on each items once so that we we get all the free copies with max remaining budget.

[01:32:53]Then with the remaining budget we get max possible items.

[01:32:59]What the [ __ ] So that we get all the free copies with the max remaining budget.

[01:33:09]So you do want every free copy and you want the budget remaining should be the le I don't understand brother I don't understand easy to easy to this guy saying easy to easy to brother it was so easy that I didn't even bother to solve it because it would be it would have been a disgrace if I tried to solve it. That's why easy to This guy saying easy to [ __ ] is saying easy to chat. This is how I was doing, bro. I thought I wrote such a clean code, but I got my ass whooped by this question, bro.

[01:33:50]I got my ass whooped by this question, bro. Let's look at what the what the actual test case was that my code was failing on MLE MLE fair because I'm going for M then it's going to be better this Want to read that TC? Want to read that test? Shut the hell up.

[01:34:47]I understand that it's just that current but yeah bro probably okay so from what I understand he broke this problem down into two problems first is a problem when you can only let's say buy every copy once free copies.

[01:35:24]Oh, so he broke it down. Okay, I understand. So he probably broke it down. Yeah, just you can buy everything only once then try to uh then Okay, maybe the [ __ ] maybe just run it once on all the notebooks which gives you free copies. I don't even know, bro. I don't even know.

[01:36:00]F= to factors of take some serious action. Second one, N too much. Yeah, bro. I became an ass in Da when I started watching your streams regularly.

[01:36:20]That's what we like to hear, bro. That's what we like to hear.

[01:36:24]There is just store the cheapest book bought so far and at the end take all those same books. This was my approach.

[01:36:30]Okay. But what if Yes, you're going correct.

[01:36:37]I don't know Hindi, bro. You're still in English.

[01:36:40]You're too cool to worry about a [ __ ] contest. Exactly. [ __ ] We don't give We don't give a [ __ ] brothers. We don't give a [ __ ] We actually don't give a [ __ ] bro. The game is rigged. I know.

[01:36:54]Golang. Should I do Golang, bro? I'm interested in doing Golang. Instead of 3dp, use 2DP.

[01:37:01]So, yeah, Llay, how to determine how much we spent?

[01:37:07]Let's ask GPD, bro. Let's ask GPD. I need to understand how the hell does this work. Bro, this question is good. I mean, I've never solved in this question.

[01:37:19]Okay, listen. So I am rated 1842 yet I couldn't solve the second question in a contest. So I'm incredibly disappointed but I'll be placing that question here and I want you to be my mentor. Do not spoon feed me but tell me how can how can we solve it. Okay brother.

[01:37:45]Okay.

[01:37:48]How many free copies you get from a exactly one batch buying a the first copy of an item is special.

[01:37:57]Every additional copy contributes that's huge observation that I I could have tried to separate it but okay separate purchases into two category.

[01:38:07]Purchase copy itself plus equals to one.

[01:38:10]Okay.

[01:38:11]Then buying the first copy of I gives Yep.

[01:38:18]Each extra copy costs.

[01:38:21]If I already activated some items, where should leftover budget go? It should obviously go into cheapest.

[01:38:30]Oh, fair, fair, fair. Because every extra budget copy gives exactly plus one. Reformulate the problem. Choose a set s of item types whose first copy you buy and with the remaining money budget minus you spend all on the globally cheapest item. So the answer looks like now stop. What optimization problem is left?

[01:38:58]The leftover term can be written by min price. Fair.

[01:39:04]Hint. What famous problem does this start resembling? You're choosing items independently. Each contributes and there is a budget value minus cost to it. The [ __ ] brother.

[01:39:16]Bro, but this is smart, bro. Chargity is smart. I made it 1842 was so much necessary. Pra bro, you are a cocky guy, bro. Shut up.

[01:39:28]You're a cocky guy. Couldn't solve too.

[01:39:30]Same, bro. Same.

[01:39:33]Same but now I don't give a [ __ ] exactly we don't care about reading theme is very good for type especially question four I think first time they introduce max concept chand bro you're getting ass at lead code like me check entrance hub bro minus 30 ano did you solve coin chain and lead code see that bro of course I have solved coin chain bro just give me the code you dumbass okay not dumb ass I'm Hey.

[01:40:12]Okay. He wants the constraints. Let's give this guy the constraints. Bro, what if it is and budget?

[01:40:23]He's asking for constraints, bro. Chibi is getting too smart. ChibiD is getting too smart. He's he asked for constraints.

[01:40:32]N is large. Budget is tiny.

[01:40:36]Napsack alarm going off. N is not large.

[01:40:41]It's just thousand for every item I bonus of I.

[01:40:48]Yeah. If you buy the MA equals to minimum price among just give me the code.

[01:40:59]Give me the code, bro.

[01:41:05]Let's see if it code worked correctly, bro.

[01:41:10]Let's see if GPD's codes can give me can give me a correct answer in first attempt.

[01:41:18]in this format.

[01:41:22]In this format, bro, just give me the code in this format because I want to see. Was it so easy to just ask chat GBD and get the correct code, bro? Was it so easy?

[01:41:37]Was it so easy? So, it was a single chat GPD prompt and 9K people did it.

[01:41:45]guys. Oh, shut the [ __ ] up. Shut the hell up. Some CP guys made today's question and cooked us. Yeah.

[01:41:55]I was saying you said that you rated 842.

[01:41:58]I know bro. I know.

[01:42:02]All kill. All kill people be prompt maxing bro. So it was a single prompt and chi done it bro. Chang is getting so much better.

[01:42:16]He's telling me he can be wrong.

[01:42:18]>> What?

[01:42:21]>> Bro, this solution is correct. Now just explain me and if possible maybe just try doing it using recursion and memorization. Thank you.

[01:42:39]Nice. Then let's what?

[01:42:42]Try again.

[01:42:44]Try again brother. Try again. Try try but don't cry.

[01:42:51]What makes the problem look hard? Who the [ __ ] asked for what makes a problem looks hard?

[01:42:59]What are we actually choosing? Which item time should be activating?

[01:43:04]It's literally choose items maximize value under budget which is just napsack. Okay. DP meaning we define DP maximum activation value using exact cost B because spending zero gives zero value.

[01:43:23]Okay. Fair fair.

[01:43:29]So this DP of I basically means activation value. The [ __ ] is activation value?

[01:43:39]cost I equal surprise I value would be 1 plus bonus of so basically how many free copies and current copies we are getting okay fair we define maximum activation value using exact cost B okay why backward because every item may be step five DP 17 meaning cost spent activating equals to 17 value obtained equals to 23 budget is 25 cheapest Bro, this Yeah, this this question [ __ ] me, bro. This question. Good question, bro.

[01:44:18]GPD oneshotted the second question. GPD onesed the second question.

[01:44:24]Why GPD? Nah, bro. No, no, no. I I said sorry to him. If GPD can we too try to understand it, bro, it's generally good problem. Just take the small hint is required. This a small hind bro I did I did nice all kill woke up late maybe virtual do yeah bro I did an all kill in like 27 minutes it was not a tough contest at all you woke up late bro s bro you got to lock in you got to lock in but bro I understand it now so try to Fair, bro. Fair, fair, fair, fair. You're trying. Okay, bro. I didn't I didn't get this idea that divided into first copies and left copies. Divide it into first copies and left copies. Dude, submit the code and check if it accepts. It obviously does, bro. GPD oneshotted the code, bro.

[01:45:26]GPD oneshotted the code.

[01:45:31]It's crazy, bro. GBD oneshotted the code.

[01:45:35]That is insane, bro. Will I get banned?

[01:45:41]Will I get banned?

[01:45:44]Hold on, bro. Will I Bro, bro, did this [ __ ] just got me banned, bro? Who was Dude, submit the code, Adish, bro.

[01:45:59]Val Val Morendi, bro. Would I get banned?

[01:46:08]Bro, if I do if I do get banned after contest, I don't know, bro. It just it still have that contest.

[01:46:23]You won't get banned.

[01:46:26]Okay, fair. Fair ban incoming.

[01:46:30]Bro, Jason, are you not that guy who hates me, bro?

[01:46:35]Jason, no. Nothing happens. Gone, bro.

[01:46:38]Nah, bro. Oh my god. At this point, I don't even care. Account should be banned.

[01:46:44]Chill out. Why you acting like cash?

[01:46:45]Shut the hell up.

[01:46:48]I've done this before. It's not chilled out.

[01:46:53]Well, to be fair, if I do get banned, my new rating, like my rating is anyways decreasing, bro. I might as well just start a new account with a fresh start, bro. Start fresh. Start fresh, bro. At this point.

[01:47:08]Anyways, you're pairing GP in a live stream. Lead code has enough evidence.

[01:47:11]Bro, I did it after the contest. I did it after the contest. Suk, brother did it after the contest. It was a ganja contest, bro. I did it after the contest. B save football yesterday, bro. I don't I I don't even know. Your coins will be reset to zero banned. No, bro. I need to get that late code cap, bro. I will not get banned. I didn't submit it in contest. What the hell do you mean? It's fine to submit after the contest. Yeah.

[01:47:43]Yeah.

[01:47:46]Scrippble, bro. Scrippble or geoger? Okay. Scribble or geio guesser or goland add option.

[01:48:00]Scribble geoger.

[01:48:04]Continue golang.

[01:48:06]Golang.

[01:48:09]Continue golang. Bro, choose one. Bro, choose one. We might do golang for like next half an hour, bro. I'm finding I am finding it to be fun of solving other problems. Hell no. Hell no, bro. Hell no, bro. Let's create a new platform.

[01:48:26][ __ ] easy problem and rating up to 10,000.

[01:48:31]Bro, we can do that. Scribble. I was I was wishing we do geoger. All voting scribble.

[01:48:41]This is my second third time on stream.

[01:48:44]It's a bit fun to solve contest with you. Yeah, bro. I bet it's fun to see a guy cry about not being able to solve.

[01:48:50]Second question, who was once a night? I bet it's fun. I bet it's fun. I bet it's fun.

[01:48:58]Good morning, brother. Good morning, Bad Late. Caffeine score. Stop gooning late night, bro. Stop those late night gooning sessions. We know. We all know.

[01:49:08]Why did you wake up late? Why did you wake up late, bro? Stop gooning late night. Scribble. Okay, bro.

[01:49:17]What the [ __ ] Why people shooting script again? Don't know, man. Never been a knight, bro. This guy has never been a knight. Are we joking? Jay, you've never been a night, bro. You sounded like a guardian.

[01:49:30]Okay, brother. Then let's just play Scribble. Bro, you guys love Scribble for some reason. I don't know. I think Geogesser is better, but Okay.

[01:49:39]Okay, brother.

[01:49:42]Create private room. It's still scribble.

[01:49:47]Don't cheat, bro. We don't need that shirt. I'm on 3k, by the way. Jass, bro.

[01:49:53]Jon, I know Jen is the guy who hates me.

[01:49:57]Jansen, whatever his name is, bro. The time we keeping 30 seconds and only two rounds. I wish there was a We can keep single round, bro. Let's keep five words.

[01:50:08]Fair.

[01:50:10]Fair, bro. Let's invite people.

[01:50:14]Can I? Some people aren't cut out for this lead course of how to get good.

[01:50:19]Bro, that's what I'm You know what? Good advice, Chris Bumstead. That's what I'm running an experiment of myself over how good I mean, the experiment I'm running on myself is I I am I have a low IQ, bro.

[01:50:35]But I'm just trying to see if I just stay consistent, how good can I get. Of course, I can never be like CM or anything, but what if I just stay consistent with the low IQ? What if I'm not like a high IQ guy, but I stay consistent? How good I can I get? Right now, it does look like that I'm getting worse, but in the long term, I want to see that. Is it a net positive or net negative? I don't know. Did I peak already?

[01:50:58]How was the contest by the way? Three and four came. Bro, it was easy. I did an all kill. I did an all kill.

[01:51:05]Same experiment I'm doing.

[01:51:08]Fair, bro. Fair. It's not about IQ. It's about information that you have.

[01:51:16]Okay, bro. Go play Geographer after scribble.

[01:51:21]Okay.

[01:51:23]Join, bro. Join.

[01:51:26]Join if you are. You growing long hair?

[01:51:28]Yes, sir. Hersa, bro. I have a deep, dark, lushy, and full hairline which I'm trying to grow out.

[01:51:37]Yes, bro. Hush. I'm growing long hair.

[01:51:39]I'm growing long hair.

[01:51:41]I'm growing long hair, bro. I'm starting, bro. Join if you want to join.

[01:51:53]Okay, let's start. Let's start.

[01:52:02]Ban is choosing a word. What a name.

[01:52:05]What a name. Remove cap once. Bro, why do you want to see my hair, bro? That's creepy.

[01:52:12]Turtle. What a good drawing, bro.

[01:52:14]Turtle.

[01:52:16]The [ __ ] is this?

[01:52:18]Sloth.

[01:52:22]Sloth.

[01:52:25]It's not a sloth.

[01:52:32]It's not a sloth. Slow.

[01:52:35]So, bro slow. Nah, I dislike this drawing. So, bro slow just because the word was slow. Are you stupid, bro?

[01:52:42]Band, are you stupid? You can't write, bro. What?

[01:52:49]Bless us with this long silky lush hair.

[01:52:52]Chill out. I I'm so dumb. I want to.

[01:52:55]Where can I read? Just showing up every day. Exactly, bro. Exactly. In the long term, it should be like net positive dot point point. Okay, it's point. Yo, nice drawing, brother. Nice drawing. Nice drawing. Nice drawing. Okay, chill.

[01:53:14]Chill with the details.

[01:53:19]Point.

[01:53:21]It's you. What do you mean by you?

[01:53:30]And people are choosing easy words, bro.

[01:53:34]Come on.

[01:53:37]You're choosing easy words. Yeah, bro.

[01:53:39]We see the drawing.

[01:53:43]Okay. And he's coloring. But who was this guy? Winner.

[01:53:48]You didn't have to put all all that effort for it to be just a hand.

[01:53:57]I've seen my friends coming up with ideas that I could and if you work hard enough you'll see that majority of new problems are some variation of existing patterns go you're asking about golang you want me to do it you want me to do it base C I What the [ __ ] is this, bro? Dislike this [ __ ] bro. Dislike this [ __ ] Wait, who was the drawer, bro? Who was the drawer?

[01:54:39]Why is not just just give up, bro? Just give up.

[01:54:46]Omelette donut.

[01:54:53]Bro, Dumpyon is guessing round. Brother, brother, this [ __ ] is not round.

[01:55:01]Bye. Bye-bye, bro. Bye-bye.

[01:55:07]Bye-bye.

[01:55:09]That [ __ ] looks like a turd.

[01:55:16]Hold up.

[01:55:22]N Q C sodium chlorine brother.

[01:55:36]Cl people are writing calcium. Holy [ __ ] bro. This cat is writing calcium, calite, cocaine, chloride. What?

[01:55:49]off campus.

[01:55:51]I already I'm interning somewhere. I'm already interning somewhere. Not right now. The code guy. What are you writing, bro? What are you writing? Bye, bro.

[01:56:00]Enjoy the game. Sect, brother. Bye-bye.

[01:56:02]Let's meet next week.

[01:56:04]House tent.

[01:56:07]Okay, fair. This is a tent.

[01:56:10]This is a tent. Okay.

[01:56:15]Jee, what do you mean Jeet?

[01:56:19]Yo, nice drawing, brother. Street kids, nice drawing. That was a good drawing.

[01:56:31]Hold on.

[01:56:40]circle ant ground bug kite obsidian people ghost beetle lobster that did not look like a lobster bro that did not I guess the word is L.

[01:57:07]He wrote N at start. Bro, chill. Chill with those.

[01:57:17]Oh, finger dumbbell dumbbell.

[01:57:34]We guessed it. We guessed it.

[01:57:37]Nice drawing. Nice drawing.

[01:57:42]Jellyfish. Yo, it's not a jellyfish.

[01:57:48]I'm about to sleep, bro. I'm about to sleep. Sleep code is not for me. I'm about to sleep.

[01:57:54]Was a crazy good contest, bro.

[01:57:57]Roll here.

[01:58:05]dirt people like path. Sorry, path. Okay.

[01:58:09]Okay. I didn't even look at the hint.

[01:58:11]What am I doing, bro? You did not require to draw that time.

[01:58:19]Just like every drawing. Why? Why?

[01:58:24]Why?

[01:58:26]Sad sleep, bro. I'm about to sleep. Boat.

[01:58:35]Cat. Fish.

[01:58:39]Cut.

[01:58:41]Cat.

[01:58:43]Cat is closed, right? Cat is close.

[01:58:48]What is this drawing?

[01:58:50]Can gun cup pin hat?

[01:58:59]Bro, is that how a hat looks like in your home?

[01:59:04]What?

[01:59:08]That was not a hat, bro. That was not a hat. RCBG, bro. Are you a Kohli fan? Harsha, bro, are you a RCB fan, bro?

[01:59:22]M mango. Bro, he left the room. He left the room, bro. This guy left the room.

[01:59:32]Mustard butter metal.

[01:59:43]Yo, look at these guy's name bro. Look at his name. This is a familyfriendly channel.

[01:59:49]Just a reminder, bro. What does that has to do with metal? No idea. No idea.

[01:59:56]Snake.

[02:00:00]What?

[02:00:05]What?

[02:00:07]But winner guessed it. Python.

[02:00:10]Oh, it's Python. Yo, see that's that's unfair, bro. Dislike this. Dislike this. You can't spell out the word, bro. You can't spell out the word. Let's play Gio guesses. This drawing all so bad. Yeah, bro. After this, we are playing Geogesser. Even I like Gio. Even I like Gio guess more, bro. For some reason, people in the chat like this more. We're going to play famous places of geog. This is still round one.

[02:00:39]There should only be there should should be an option to only have one round though.

[02:00:47]What's this flag?

[02:00:51]Japan jail. Oh, it's jail.

[02:00:57]Yo, nice. Nice drawing, Freddy, bro.

[02:00:59]Nice drawing.

[02:01:04]Nice drawing, bro. That did look like a jail. Change game, bro.

[02:01:10]Bro, after this after this, we're going to play we're going to play Geogesser.

[02:01:14]Famous place is geog dislike all why bro dumpy bro why do you want to dislike all drawing see ocean yo who's the drawer broy bro nice drawing nice drawing you get a like you get a like dislike all drawings to win yourself wait how does Does that work? How does that work? If I dislike every drawing or complain about everything. Okay, I won't. I won't.

[02:01:55]Okay, fair.

[02:01:57]Table G.

[02:02:06]What?

[02:02:09]Geologist.

[02:02:13]Geography.

[02:02:17]Geog.

[02:02:26]The only thing that was worse than the second question today was this gorilla drawing. Bro, who was the drawer, bro?

[02:02:33]Just tell me his name, bro. Who was the drawer, bro? Who drew that?

[02:02:38]Who drew that, bro?

[02:02:41]You should draw Pist. I look like a gorilla, bro. I do have muscles like gorilla. It's like all rins too. When you're bro dumpy, bro. Just chill.

[02:02:52]Falcon missile. A B2 bomber aircraft.

[02:03:06]Okay. No, you don't have muscle like gorilla, bro. Just chill. You don't know about my muscles.

[02:03:12]Uh, let's do an easy one, bro. Let's do an easy one.

[02:03:20]Good draw, brother.

[02:03:23]Yeah. Look at them cheaters, bro. Look at them cheaters.

[02:03:31]And they are disliking. And they are disliking.

[02:03:34]Fair, bro. This is like you have hair on your You have You guys have that hair on your tomb. I even draw drew that stream sniped. Of course, it's food. Bad drawing. The hell do you mean bad drawing, bro? That's literally how your food looks. I don't know how the [ __ ] am I solving only one from past contest.

[02:03:56]Same, bro. What's this thumbnail, bro? I can't I'll remain bald on my thumbnail until I regain my night badge, bro.

[02:04:05]Fourth one was copied from code forces.

[02:04:07]Yo, dread, bro. Where have you been, Red? What's up, bro? Where have you been, bro?

[02:04:17]Boom. Nuclear bomb.

[02:04:23]Explosion. Explosion. We guessed it. We guessed it. I was the last person to guess it.

[02:04:30]I was the last person to guess it.

[02:04:34]Long time no see, bro. Where have you been? How much you did, bro? I did all kill. I did all kill. Second question to be fair. Second question can be of DP but today was a good question. I couldn't solve it.

[02:04:49]The hell? Sharper.

[02:04:53]Sharp nerd.

[02:04:58]What?

[02:05:01]What is that?

[02:05:04]Dono guessed it.

[02:05:07]Pencil case. Dono, bro. How did you guess it?

[02:05:13]How the hell do these people guess it, bro? It was five pointers to make sense.

[02:05:20]As an abs. Oh my god, bro. Dead with his with his actions again, bro. Everything is Asan for dread, bro. according to bread brother.

[02:05:34]Hold on. What's this now?

[02:05:38]Fil wave length wave.

[02:05:50]The first one is wave wine glass.

[02:05:59]Okay, bro. Okay.

[02:06:02]Okay. I was close. Mine funnel. No, you were not, bro. You were not bad as hell.

[02:06:11]Draw, bro. Who's drawing?

[02:06:14]Who's drawing, brother?

[02:06:17]Draw.

[02:06:19]I suck at greedy, bro. Red dollar money. Money. We guessed it.

[02:06:28]Penny, bro. They guys are guessing penny. That's dumb as hell, bro. These guys are guessing. It was nap time. I was just [ __ ] dead [ __ ] for that free items. Exactly. Bro, you sold only one, bro. I did an all kill. What do you mean? What do you mean? I I did an all kill.

[02:06:47]1940 to 1970, bro. Ammon, that is crazy, bro. 19 + 30 is crazy.

[02:06:56]D What is What starts with D and look like a girl?

[02:07:07]Don't go. What?

[02:07:13]Don't.

[02:07:20]Yeah, today is not a good day. It's not a good day. Yo, why is your ranking showing 11.8K on entrance hub? Bro, it's not updated. It's not updated.

[02:07:30]It's not updated, bro. It's not updated.

[02:07:33]I did an all kill.

[02:07:39]M y my face cherry berry book.

[02:07:55]Oh, I was dumb, bro. I was dumb. Dumpy don't, bro. Dislike Dumpy's drawing, bro. He was disliking everybody's drawing. It's a threeletter word.

[02:08:12]Middle.

[02:08:16]What?

[02:08:18]Boy.

[02:08:22]What the hell is he drawing?

[02:08:29]P M X stupid drawing bro stupid drawing stupid word show ranking proof all kill bro just believe me just believe me just believe me start giving code for this contest I just have weekend free stream balloon balloon bro ammon you don't believe me you think I'm lying You think I'm lying, bro? Show ranking.

[02:09:04]Ammon, bro, you think I'm a I'm a liar.

[02:09:07]Your submission shows two sold. Why, bro? It's not updated. That's why it's not updated. Just believe me, bro. Just believe me.

[02:09:20]Take all drawings to win yourself.

[02:09:23]This guy is crazy.

[02:09:26]This guy is crazy.

[02:09:29]Yo, why is why did you draw that third leg?

[02:09:33]Why did he draw the third leg?

[02:09:39]Bro, what?

[02:09:43]Are they about to What?

[02:09:54]I don't even know what does this word means. I don't even know what this is for. You're lying like my GF, bro. You just got minus five. Pra, shut your ass up, bro. It's for nature's purposes with her, man. Exit our board happening, bro. I feel like Yeah, this is the round two, bro. We after that's why I don't like scribble. After this, we're going to play geographer. This is about to end. Facebook.

[02:10:23]Mark Zuckerberg.

[02:10:26]We guessed it. We guessed it.

[02:10:32]Nice drawing. That's smart. That's smart of you.

[02:10:37]Enu is choosing the word.

[02:10:43]Are we a [ __ ] fall?

[02:10:50]Flag.

[02:10:52]Flag.

[02:10:54]Flag. I was the last person to guess.

[02:10:59]I was the last person to guess.

[02:11:03]His mom's dead.

[02:11:06]Yo, look at K. Look at this guy.

[02:11:12]Choose bro you guess after this bro after this boring live stream why she left you bro she was never there with me to begin with one who look chef chef this is chef This is chef.

[02:11:46]Chef, bro. Dumpy, stop spamming.

[02:11:50]Heroes choosing a word. How many people are left bro? After this, we got to play. We got to play geio guessess.

[02:12:00]Do go man.

[02:12:04]Light street lamp.

[02:12:23]Winner guessed it. Night light. Night light.

[02:12:29][ __ ] is choosing a word.

[02:12:34]Let's see how he does it.

[02:12:36]Well, I'm winning as of right now.

[02:12:39]12,770 points. I'm winning as of right now.

[02:12:44]Flag, India, Russia.

[02:12:51]Uh, it ends with a Y. It ends with a Y.

[02:12:58]Par Hungary bro Germany. Oh [ __ ] It was Bro, I'm going to look like a stupid dumbass it was Germany. Of course.

[02:13:18]Of course it was Germany.

[02:13:25]Draw, brother. Suzu body. Draw, bro.

[02:13:32]It's a laptop.

[02:13:37]Laptop.

[02:13:39]Laptop.

[02:13:41]We know.

[02:13:45]Nice drawing. Nice drawing.

[02:13:49]Bro, why are you kicking soy?

[02:13:52]Well, I'm third now. I need to I need to guess fast, bro. I'm third now. [ __ ] Dumpy Don is winning.

[02:14:03]How is he saying his name with a say?

[02:14:05]Straight face. Whose name are you talking with?

[02:14:10]Book Zorp.

[02:14:21]MVP.

[02:14:22]What? Grab up grab.

[02:14:29]What the hell? What the hell? Dumpy, bro. Chill.

[02:14:34]What the hell was that?

[02:14:38]I'm so supportive. Rescoding, bro.

[02:14:40]Choose a better name. What is that name?

[02:14:44]Car.

[02:14:48]Car brand Ferrari.

[02:14:52]We guessed it. The first person to guess it was me. Thank you.

[02:14:57]People still can't guess it. Oh, you're dumb as [ __ ] if you can't guess it.

[02:15:06]Okay, now bro, you you're not supposed to spell the word.

[02:15:11]You're not supposed to spell out the word.

[02:15:16]Let's choose chef boots. No, I should have chosen cupcake.

[02:15:27]Yeah, look at them. Look at them cheating, bro. Look at them cheating.

[02:15:37]I got good drawings, though. I got good drawings. Is that hair, bro? That's the cap of a chef. That's the cap of a chef.

[02:15:47]Winner is the winner, bro. I wish he had that air. Oh, shut up.

[02:15:54]Winner is the winner. Okay, bro. You're not playing another setting.

[02:15:59]Who max?

[02:16:01]Okay, I'm sucker mana.

[02:16:05]Okay, fair. One last game of open guesser using famous places. Open guesser using famous places.

[02:16:14]Host uh not India. Uh let's not keep India.

[02:16:20]Let's just do famous places and uh let's keep it 40 seconds. It is six rounds.

[02:16:29]Create this room. Name would be Kish.

[02:16:32]Bro, I like open guessers so much more than scribble.

[02:16:36]Bro, join this if you want to play open guesser.

[02:16:39]Join this.

[02:16:46]Join this brother.

[02:16:49]Los Santos.

[02:16:52]The hell do you mean Los Santos? Bro, Jazz Jazz say on Freud 3112, bro. Are you not that guy whom I'm thinking you are? How do you know about famous places when you're in your house 24/7? You think I'm in my house 24/7? I go out to clubs and bars every weekend, bro. I talk with the H. Everything, bro.

[02:17:17]You think you think I only do lead code.

[02:17:19]I talk with the H, bro. I go to bars and clubs, bro. And I do a lot of other things which I can't say on streams, bro.

[02:17:28]20 people. Let's start.

[02:17:31]Starting in three.

[02:17:37]What?

[02:17:40]Where is this place?

[02:17:47]This looks like grease, bro.

[02:17:50]What the hell?

[02:18:02]How much time do 10, bro? This looks like Greece.

[02:18:06]Where is Greece, bro? Somewhere near 8 or somewhere. I don't know.

[02:18:19]Correct, bro. Correct. That's why I like this game, bro. This requires skill.

[02:18:24]Clubs and bars and h Yeah, you guys won't believe me. I know.

[02:18:32]Oh, this is this is Stonehenge.

[02:18:38]This is Stonehenge.

[02:18:42]Is this Stonehenge?

[02:18:45]Bro, what the hell is this place? India, bro. Shut just shut up. This is not India. Is this Stonehenge? I'm guessing UK, bro. Stonehenge is in UK or what?

[02:18:59]Or maybe Easter Island? This can be London.

[02:19:04]No, this is not London. What did I do?

[02:19:08]This is in Turkey.

[02:19:13]I got cooked in this one.

[02:19:16]How do you know these things? You have to go out of your home, bro. You have to go.

[02:19:22]What is this place?

[02:19:25]Show me. Show me the structure, bro.

[02:19:27]Show me the structure.

[02:19:36]Where the hell is Statue of Liberty?

[02:19:38]It's on It's on somewhere here, right?

[02:19:42]Bro, I don't know where is Statue of Liberty.

[02:19:47]Long Island.

[02:19:50]Long Island.

[02:19:54]Where in New York though?

[02:20:02]88 kilometers. Adesh. Got it. Adesh brother. Okay. Okay. Continue.

[02:20:09]Continue. You travel a lot. More money.

[02:20:11]Damn. Yeah, bro. Every week.

[02:20:16]Hold up. Oh sh. This is literally even a blind guy can tell that this is Moscow, the capital of Russia.

[02:20:27]This is St. Basil's Cathedral. Bro, guess it easy as hell. Easy as hell, bro.

[02:20:34]Like, even a blind person can tell this is Russian architecture.

[02:20:39]Look at how wide the roads there are.

[02:20:42]And there's not a single car.

[02:20:46]And it's clean as hell.

[02:20:49]And it's clean as hell, bro.

[02:20:55]I was correct. My guess is correct. Rainbolt. Yes sir.

[02:21:03]Yes sir.

[02:21:05]Bear game. You got to be okay. This is Okay. This country has come before too.

[02:21:14]This is Peru.

[02:21:18]Peru.

[02:21:20]Peru.

[02:21:22]This is not Brazil, bro. This is not Brazil.

[02:21:28]What is this?

[02:21:31]This is Peru. Bro, not Brazil.

[02:21:37]You don't you don't need to type it. You need to like point it on the map.

[02:21:46]Damn, bro.

[02:21:48]386 kilometers.

[02:21:50]Okay, man. Yeah, everybody did Peru.

[02:21:55]Fair, fair. Keep it India. Yeah, gang.

[02:21:58]It's above my brain, bro. India is the toughest country to guess. Oh, Niagara Falls, bro. Another easy.

[02:22:09]Where is Niagara Falls?

[02:22:12]Has to be near the border, bro. Has to be near the border.

[02:22:18]Buffalo.

[02:22:23]Detroit.

[02:22:29]Bro, where is Niagara Falls?

[02:22:41]Correct. Correct.

[02:22:44]Correct.

[02:22:46]See, I kick everybody's ass in this game, bro. Hudish won. Of course, I'm going to win, bro. Of course. There's nobody better than me. new Niger Falls, bro. Shut up. Okay, then that's it for the stream. Let's meet next weekend. Bad contest, but it's a habit at this point. Have a good week.

[02:23:09]Bye-bye.