Leetcode weekly contest 500🥳

追加: 2026-05-10

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

[00:00:11]500 lead cool contest, bro. That's crazy.

[00:00:15]Good morning.

[00:00:18]And I'm kind of late. It's about to start.

[00:00:24]Yep.

[00:00:37]Starting in 55 seconds.

[00:00:46]I was waiting, bro. What's up, bro?

[00:00:48]What's up? We are here.

[00:00:52]Good morning, bro. MiniA mini.

[00:00:58]What's up, bro? Yo, dreams come true, bro. Bro, I'm not even awake. Can you typing messages like those, bro? I'm going to beat your ass. Yo, what's up, bro? Good luck. Good luck. Good luck, bro. 20 seconds.

[00:01:19]Good night.

[00:01:24]Oh my god, bro. Good night, bro. Good night. Good day, bro. What's up?

[00:01:32]Join join. Join join join.

[00:01:39]load.

[00:01:40][snorts] They have different parody.

[00:03:43]2 1 0 0.

[00:03:49]Yeah, bro. Fair one. Next question.

[00:03:56]You given an integer and my screen is blur, right? Yeah.

[00:04:03]the integer form by reversing the digits of n return the sum of all five numbers of harass bro I'll kill self one 31. Let's read the prime numbers.

[00:04:47]10 and 17. One and one. Nine and nine.

[00:04:58]It's fine.

[00:05:06]equals to two.

[00:05:20]If X percentals to zero Okay, we got to reverse that. Okay, bring How to reverse a string? Is it It's just reverse, right? Yeah.

[00:06:13]Reverse strings. It's just reverse, right? That reverse function. Yeah.

[00:06:24]Okay. Uh reverse B dot begin, B dot and you reverse it. Now int r equals to string to integer b.

[00:07:09]inclusive for I = to L. I less than = to M A ++ if prime I plus = I 132.

[00:07:35]How the [ __ ] am I getting 170?

[00:07:56]Yeah.

[00:08:00]If a false return true for one.

[00:08:26]Oh, okay.

[00:08:35]What?

[00:08:38]Bro, easy, bro. Easy.

[00:08:47]Yeah. 13270 and zero. Yep. We like that.

[00:08:55]We like that.

[00:08:59]Fair bro, this question was a joke.

[00:09:03]Let's speedrun this. We are speedr runninging this. You're given an integer and nums with nums is strictly increasing. For each index x, let closest x be the adjacent index such that absolute of nums x minus nums y is minimized. If both adjacent indices exist.

[00:09:24]If both adjacent indices exist and give the same difference, choose a smaller index.

[00:09:31]Okay.

[00:09:33]For any index X, you can move in two ways to any index I because absolute to closest index you can move in two ways index difference with cost.

[00:09:58]You're also given student wear queries, bro. Chad, are we cooked? Are we [ __ ] cooked, bro? Is that it? Querious question as a third question. Quarius question as a third question.

[00:10:13]You're also given a 2D integer queries where for each query calculate the minimum total cost to move from index li to R index turn an integer answer for each index I let closest X be the adjacent index. The [ __ ] is adjacent index? Adjacent index means plus or minus says that absolute n x minus n is minimized. If both adjacent indexes exist and give the same difference, choose a smaller index. Okay. For any index x, you can move in two ways to any index y to close it.

[00:11:14]Roange queries, bro. Are we cooked, bro?

[00:11:18]Are we cooked, bro?

[00:11:21]Yo, we cooked already.

[00:11:25]Are we cooked?

[00:11:34]So calculate the minimum total cost cost to move from index LI to RA.

[00:11:41]To move from 0 to two, the closest indices are is one of minus 2.

[00:11:59]Y is 2 - - 5 that is 3.

[00:12:10]Choose another small index. Okay. Okay.

[00:12:14]Okay. It's clear one. Obviously for 0,2 the path use a closest move from bro.

[00:12:20]They why the hell they have asked this as a range query question. For 02 the path 012 uses a closest move from index 0 to one with the cost one.

[00:12:38]to from any index. You can jump to any other index with that cost with the difference of their cost or to closest with one.

[00:12:54]You definitely don't want to jump. If the closest is on the left side, you definitely don't want to jump to the closest if the closest is on left side.

[00:13:04]What are they doing here?

[00:13:08]One, right? Z range queries. How the hell are we solving this? The range queries question, bro.

[00:13:30]Why is this a range query, bro? Are we cooked, bro?

[00:13:35]Namzai is 10 to 9.

[00:13:41]No. Okay. 10 to 5. Queries is 10 to 5.

[00:13:47]Queries is 10. I've never solved questions like these, bro. I've never solved questions like these.

[00:13:55]What's up, my bro? Yapping on mute. Yo, 9 a.m. games, bro.

[00:14:01]What's up? What's up, bro? What's up?

[00:14:09]For each query, calculate the minimum.

[00:14:15]0239 0239 wait.

[00:14:27]This is strictly increasing.

[00:14:40]Yeah. Okay. So the logic is this is strictly increasing. We would never want to go left in any case whatsoever. We would never there's no case that we would want to go left. We al always want to go right. If the closest is on right just always move right.

[00:14:58]H. Now it the point is okay. So basically always move right until the closest is on left. when the closest is on left just jump to the last element I guess I guess that is the logic like if I I don't know bro I don't know here let's see if I closest of x it's it's one for two 2 - 0 2 - 3 Yep. The absolute number x - y.

[00:15:47]>> Yeah. So, it's zero for three. 3 - 2 is 1. 3 - 9 is minus.

[00:15:56]So, we're going to go with uh one here.

[00:16:00]Of course, it's two. So now if the range query says you want to go from 3 to zero, bro, 3 to 0, we're also going backwards.

[00:16:14]Oh my god, bro.

[00:16:17]3 to 0. Okay, that's the same thing.

[00:16:20]Honestly, nothing nothing too different.

[00:16:22]You would always want to go if the closest points towards right, always go there. So from 3 to 0.

[00:16:33]Yeah, it's just move closest. Move to closest. It's it's 2 1. It's 2 1 0.

[00:16:43]Yeah.

[00:16:45]Yep. Yep. Yep. Yep. Yep.

[00:16:52]Yep.

[00:16:53]The point is how do I solve this in a range some query? Okay. The logic to find the optimal cost is pretty clear.

[00:17:00]How do I let's say if you if you going if you want to go from one to two 0.

[00:17:06]Yeah. From 1 to 2 the cost is uh 3 - 2 1.

[00:17:14]From 2 to 0 from 2 to 0 is 2.

[00:17:26]The closest and dices are one one two one two.

[00:17:34]Oh, stupid. Yeah.

[00:17:39]Yeah. Okay. Now, how do we calculate it for range sum?

[00:17:49]I think we only need to know Yep. Okay. I think I have I have some logic in my mind, bro.

[00:18:04]What every number we have to Okay. Okay. Okay. Okay. Hold on.

[00:18:21]Bro, hold on. Hold on. Hold on. I think Yeah, bro. Hold on.

[00:18:28]No, bro. Chill. I'm not cooking from this point.

[00:18:41]From this point, you go on. Right.

[00:18:48]Hold on. This is 0 1 2 3. Okay. Now from three if we want to go on from three we can go to two only.

[00:19:08]L is one and R is zero.

[00:19:12]Of course.

[00:19:15]Of course.

[00:19:17]Of course.

[00:19:39]Okay. Okay. Okay. I don't know, bro. I think so. I have something in my mind.

[00:19:48]How many positions right by just jumping to closest. So first of all calculate closest. Okay. First of all we do that.

[00:20:08]Yeah.

[00:20:14]closest. So for first of all rename this as a r for int i =0 i if i equals equals to error dot size minus one.

[00:20:50]Then you closest dot push back uh closest for push back error dot size minus two. Yeah, the last one will always go to second last where L equals to absolute of error I - error I - one that is smaller than Hold on, bro. Hold on.

[00:21:55]Absolute minus R + one. If that is this is smaller than or if it is equals to error closest dot push closes dot push back I minus one else closes dot push push dot push T I + one. Okay, we do that.

[00:22:33]Okay, fair, bro.

[00:22:36]Fair. Okay, we are calculating closest correctly. Looks like.

[00:22:43]Yeah.

[00:22:45]Yep. Okay, that that helps us calculate closest array.

[00:22:51]Now we need to see H. Wait, bro. Vector of pair of honestly. Yep.

[00:23:10]Yep. Yep. Yep.

[00:23:13]We don't even need a pair of intent, bro.

[00:23:16]We don't even need a pair of intent.

[00:23:30]is actually vector int of uh moves.

[00:23:37]This stores that from the current index how many places can you move either left or right by simply you where is my cursor by simply uh using the zest.

[00:24:04]Okay.

[00:24:06]For in = to0 I less than uh error dot size A++. Okay. Now the moves is uh she got me something like Hey yo Aisha Sha.

[00:24:22]What's good bro? Good morning. Good morning.

[00:24:25]Yep. Now we just have to moves dot push back.

[00:25:11]Yep.

[00:25:14]Okay. Okay. Hold on, bro. Let me think.

[00:25:16]Let me think. Let me think. Bro, I think I'm in the correct direction, though. I think I'm in the correct direction, though.

[00:25:42]>> [cough] >> Okay. Okay. Let's let's actually divide it into left and right.

[00:25:56]or in fact yeah first calculate how many indexes right can you go from any index X print moves and n okay vector in moves of size n initially all zero for in i = n -1 i ++ i in fact Yeah, you can't go right from the last element, right? I not I is greater than equals to Z I - if [snorts] closes if closes of I is greater than I then we can say moves of I equals to 1 + moves off.

[00:27:49]Closest of five is greater than key index. Closest index to move of i is 1 plus uh in total ride equals to 1.

[00:28:32]If um moves of i + 1 yeah if moves of i + 1 is greater than zero if means it's right can also go right then we can say total right plus equals to moves of i + 1 and then just you say moves of current i your index Right, that is it.

[00:29:07]Now we have to see how many left for in i = 1 i less than n i ++.

[00:29:28]Yep. Now we have to see if closest of I is actually less than I then you can say in total left total left equals to 1. If moves of I minus one if that is less than zero then we can say total left plus equals to -1 star moves of i minus one. Okay moves of ius one. Bro I'm I'm I'm over complicating it. I think so. Moves of ius one. And then you just say moves of I equals to minus one star uh total left.

[00:30:24]Okay, we have our moves array. We have our moves add array. Yo bro, am I am I cooking or am I cooked?

[00:30:33]Third one is greedy plus prefix.

[00:30:37]I'm doing it using some different greedy I I think yeah I'm following this approach is is considered as greedy or something.

[00:30:48]Yeah, I'm kind of I think Yeah, now you just have to see the range queries for auto P of your let's say queries int L equals to P is it a pair If you want to go from zero to if you want if we want to go right can ln R L and R be equal? Yes, they can.

[00:31:53]If if L equals equals to R then you can say answer dot answer dot push back zero.

[00:32:04]Okay.

[00:32:05]Now, now the next part is bro, I need some space to write.

[00:32:12]I'm over complicating it like I always do. If L is less than R, see how many right can you possibly go from L.

[00:32:30]and ride equal to moves I no first just see if from L you can go right if moves of L if that is actually less than zero then we just simply take the difference of there. Yeah. Absolute x - y to any index.

[00:33:08]Yeah. Then we can just say answer dot push back absolute value of absolute value of uh a r l minus a r.

[00:33:26]That's it.

[00:33:30]Yep. Now else.

[00:33:47]L support going right. Now int max right equals to L + moves of L.

[00:34:00]If max right is greater than equals to r then answer we use closest to read till r then answer dot push back from let's say if you're going from 0 to one the answer would be one 0 to 2 is 1 one yeah so it's basically yeah r minus l difference of ind indices Right.

[00:34:31]We can partially use closest then jump using ratio two. Now here bro I've written I'm writing trash code bro I know. Yo this is stupid. This is stupid.

[00:34:59]Okay.

[00:35:04]Uh so partially use closes. I'm using two uh in closest sum would be equals to moves of I would be L + moves of L, right?

[00:35:46]L plus moves of L int sum equals to moves of L.

[00:36:03]Yeah. And sum equals to moves of L. That just tells you how many it can go.

[00:36:08]Right. Okay. Okay. Now, now you just have to say sum plus equals to uh sum plus equals to absolute value of absolute value of uh your error right Max minus error R then answer dot answer dot push back your sum. Okay, I think this covers all the cases.

[00:36:57]This cover all the cases.

[00:37:00]else we want to go left. Okay, we want to go left.

[00:37:10]First we see if from L you can go right, you can't go left. Now in here it would be same if I copy the code here first we see from can't go right first we see you can't go left moves greater than zero Moves of 0 is one. Moves of n minus one = -1 now. Okay.

[00:38:10]You can't go left. Okay. Now else about going right.

[00:38:44]Yep. Okay.

[00:38:49]And you want to move like right now if you can else means bro I'm over complicating this but the logic means you can go left from You can go left from from L. Okay. Now the first thing we see Yep.

[00:39:37]We're all using closest and max left would be equal to max left would be equals to L plus moves of I. That's it.

[00:40:03]L plus moves of L.

[00:40:07]Yeah, kind of. Exactly.

[00:40:11]Exactly. Something like Okay, we do that. Now, if left that is less than or equals to R, then we can say answer dot push back the difference of their Yeah.

[00:40:36]Push back.

[00:40:42]L minus R.

[00:40:46]Okay.

[00:40:47]Else use max.

[00:41:00]Partially use closest. partially use closest and then jump friction [clears throat] two. Okay, the code is going good right now.

[00:41:17]20 indexes cost Y max left is fair right here. Now the thing is yep sum is basically how much are you going left moves L star minus one. Okay because it's left right moves will always be left. Now uh we have max left max right and they are the same thing but okay we have max left sum plus equals to sum plus equals to uh absolute value of max left minus uh max air r max left minus a r x answer push back sum push answer dot push back sum, right? We do that in the end. Just return the answer, bro.

[00:43:14]Return answer. Let's see, bro, if this works. This is surely not going to work.

[00:43:19]We're getting 0 to 6 to 5. Okay, at least two of them are 413. Yo, this first one is partially incorrect. The rest all are working correct. Why is this? Let's just first calculate the closest and then we'll calculate the moves.

[00:43:39]I less than uh N I ++ C out I see C out del or I =0 I I less than I ++ see out uh closest of I.

[00:44:02]Okay. Now see out and L. Now for in =0 I less than N I ++ see out moves of I say out and L.

[00:44:26]Okay. Now we have index closest moves.

[00:44:30]The closest one. Yep.

[00:44:35]Right. 1 0 1. So from this point from zero you can go to one. That means it's one. From one you can go to zero.

[00:44:45]That means it's minus one.

[00:44:48]Yep. From two you can go to one and from one you can go to zero. Okay. The moves is also correct. Why is my output zero then? Why is my output zero? The first query is 0a 2. That means it's going to go in L is smaller than R. L is smaller than R.

[00:45:12]Z, bro. Chat. Yo.

[00:45:17]Yo, B did first like under 9 minutes.

[00:45:21]Now just clueless with rest too. Pies B cook something out, bro. Honestly, I think I have the correct logic, bro. I have the correct logic in my mind. Third is too easy pad Gandhi. Shut your [ __ ] ass up, bro. Shut up. Shut up, bro.

[00:45:36]You're my brother. But please shut up.

[00:45:38]It's not easy. It's not easy. But I think I have very one last Why is this now? First just see if from L you can't go right moves of L.

[00:45:55]So the query is the query is zero.

[00:46:07]No, we can from 0 to we want to go from 0 to two. That is where my answer is coming out as wrong. It should be six.

[00:46:15]It's coming out zero. Okay. Okay.

[00:46:21]This fails.

[00:46:23]L support going right. Now max right from L would be L plus moves of L that is index one.

[00:46:33]No, this would fail. L sum equals to moves of L. A index right max equals to L plus moves of L. We we have that max right max right.

[00:46:53]Max right.

[00:46:57]Okay, we have this. We What? Where is my logic failing? This is impossible. Sum equals to moves of L. Then sum plus equals to absolute of a r max right minus a r r answer. push back sum b.

[00:47:18]How is this possible?

[00:47:22]I guess we have to debug using typing a lot of [ __ ] See out L.

[00:47:38]Bro, debugging typing out seeouts is so ass.

[00:47:44]See out L supports going right. Going right. Okay.

[00:47:54]L supports going right.

[00:47:58]Till max right. RA GHT till max right. Okay. Now if max right is greater than our answer. Push back R minus L.

[00:48:20]Yeah, I think this should help me debug.

[00:48:24]What? Okay. Okay. Hold on. Hold on. Hold on. Well, good question, bro. I love lead code for putting this question in.

[00:48:31]L supports going right till one. Right.

[00:48:35]It does. So, we are going till here.

[00:48:41]Where the [ __ ] is it?

[00:48:45]In the case of 02.

[00:48:48][cough] Now if max right is greater than equals to r.

[00:48:55]See how partial plus partial plus jump partial plus jump. Is it reaching here?

[00:49:17]partial jump.

[00:49:23]How is my output [ __ ] zero?

[00:49:27]Sum sum plus equals to absolute of max.

[00:49:36]Write minus uh a r what?

[00:49:49]How is this possible bro? Yeah moves.

[00:50:01]Max right is basically L supports going right till one. Fair enough.

[00:50:14]Max right 1 - 2 that's minus one is my absolute value.

[00:50:21]Oh, bro. I think absolute value most probably. Yeah.

[00:50:38]She got me something like Okay, bro. It was an index error that caused me this [ __ ] bro. It was an index error, bro.

[00:50:53]Sum plus equals to sum plus equals to absolute value plus key of key max right minus error r key no viable overloaded Yellow by yellow in addals to this sum plus equals to two add a okay okay sum plus equals to see okay this should work now Oh to add equals to absolute of this.

[00:52:03]Now sum plus equals to 2 add what expected for the function?

[00:52:17]Hold on, hold on, hold on.

[00:52:21]Now we're getting 6 to 5 and we're getting 413.

[00:52:37]10 to 9, bro. What?

[00:52:44]Holy [ __ ] R equals to absolute of error r max left minus a r of r.

[00:52:54]Now just do sum plus equals to two add.

[00:52:59]Sum plus equals to two add. Y that is crazy. Chad I I have written the logic. guys submit it after doing converting it to long longs.

[00:53:10]Bro, this question is stupid, bro.

[00:53:13]Stupid, bro. Third one is annoying.

[00:53:14]Yeah, bro. Exactly. Exactly, bro. Where can I get code? Yo, MSM Gaming Zone 7833.

[00:53:21]Shut up, bro. We don't share codes here.

[00:53:25]So vector end total right.

[00:53:38]Okay. Ll L l Okay.

[00:53:47]L L Okay.

[00:54:01]L 413 second 413 first 625 although I still think I'll get wrong answer somewhere bro but I think I need to submit case found my body.

[00:54:29]I need to submit anyhow. I cannot find those edge cases myself.

[00:54:38]Ting 6 to 5 413.

[00:54:43]It's asking us to return a vector of int.

[00:54:50][screaming] Chill chill chill chill chill. We pass 133.

[00:54:57]How is there? Yo, wait. How is there an extra zero in here?

[00:55:04]What? How is there an extra zero in here? How? How many?

[00:55:11]This is an answer, right?

[00:55:22]What the hell, bro?

[00:55:25]How? Answer dot.

[00:55:28]If L is less than Rick, what am I doing?

[00:55:40]But no, bro. It What?

[00:55:46]Okay, it's correct now. It's correct now.

[00:55:50]625 4130.

[00:55:57][screaming] Okay, bro. How many? 198 one. Chill, bro. We can debug this. We can debug this.

[00:56:10]I need to uncomment my debug statements.

[00:56:14]Uncomment my debug statements. output is 29 and 22 from 2 to 0 uncomment my debug statements.

[00:56:24]So uh moves okay moves is Use test case.

[00:56:55]1 1 2 say 3 3 2 3 3 say 2 1 0 say 1 1 Say 0 1 - 1 1 - 1 2 0 You can go right L is greater than R if L equals to R. Else if L is less than R, L is greater than R. If moves of L is greater than zero, answer push back Q answer.

[00:57:49]You can move to any index y with cos absolute nums x minus nums y x y l r x y. So 17 - -2 is 29. How is it 20?

[00:58:20]Bro, 24 012 to 17 say 17 24.

[00:58:36]Yo, don't tell me. Is it kind of like two say three 24? Why is it?

[00:58:48]How is it 22, bro?

[00:58:51]22.

[00:58:54]Yo, what is the What is the logic here, bro?

[00:58:58]Oh, that fire is too loud. My father slapped me. Chill out, bro.

[00:59:05]I change that far sound. What should I do then? Brute force. People are doing N square, bro. TL, bro. People are DLing, bro.

[00:59:15]Chill. How does this make sense? Hold on. Hold on.

[00:59:21]So, from 17, the closest up 2 0 1 2.

[00:59:40]So you're telling me go to 24 or 24 minus 24 + 12 36 17 + 12 29 chat can somebody I can't understand the test case according to me it should be 29 why is it 22 if you want to go from 01 to 17 yeah you can go to the closest of 17 which is basically this.

[01:00:14]Huh?

[01:00:16]Which is basically this.

[01:00:23]But what? How is Bro, where am I going wrong, bro? 2 1 0 2 1 0 Why we can't go 17 to -4.

[01:00:43]Hold on. So you're telling me rather than jumping directly, you're adding there those segments 17 - - 4 is 21.

[01:00:58]Yo, this is insane, bro. This Okay, what? How will we do this then?

[01:01:20]That's [ __ ] insane. No way, bro.

[01:01:24]No way.

[01:01:32]Okay, you this question is this question has another thing that I didn't even consider. I just thought pick the start element either jump to the closest if they are valid or directly jump. But in here yo You know what? This is going to make my code absolutely worse. But this is the only way I can solve this. Now I'm duplicating my entire code.

[01:02:14]L = to P1 P 0.

[01:02:25]Answer two.

[01:02:28]Answer two.

[01:02:32]Answer two.

[01:02:35]Answer two.

[01:02:38]Uh, [groaning] answer two. Bro, this is going to Yo, I don't I don't think so this would work now. Or else I can't solve this question, bro. At least not in the time limit. Not in the time limit, bro.

[01:02:53]Answer.

[01:02:56]Answer. Pull back. Answer. Answer.

[01:02:58]Answer.

[01:03:03]Take. Answer two. Uh-huh. Uh-huh.

[01:03:09]Yeah. Uh, okay. Fair. Now answer size I ++ uh F answer. Push back minimum between minimum between Answer of I, answer two of I.

[01:03:48]This is an absolute shameless way.

[01:03:52]Unknown network error. 2221 412 22 22. At least this is working, bro.

[01:04:09]How does that [ __ ] make sense, bro?

[01:04:12]Yo, I'm cooked, bro. Bro, I'm cooked.

[01:04:17]Bro, I'm cooked. Yeah, if you don't get closest, then jump to it with the absolute value. Exactly, bro. Oh, Jagger, bro. 30 minutes left. How much sleep? Three and a half hours. You should always go by one index.

[01:04:32]No, the logic here is this this test kit is stupid from 17.

[01:04:45]So from 17 if we choose closest we can go right. So the thing is we can just jump to minus12. That is what my logic does. But this question is saying from 17 jump to minus4 then check again from minus4 if not okay so I think rather than jumping directly yeah that's [ __ ] it the point is I'll have to rewrite my whole approach as a function then I feel like I'll have to rewrite my approach as a function. How much time do we have? 26 minutes. Yo, I think we can solve this, bro.

[01:05:34]We can solve this.

[01:05:41]Yo, this is stupid. No way, bro. I can't write such big code again.

[01:05:56]I can't write such big code again.

[01:06:01]So what am I doing is 17 closest right? This question says even if the closes right move towards left then just do we keep moving on towards left after moving on towards left we realized so what this question is Crazy fourth seems very doable, bro. I'll beat your ass, bro. Question for statement.

[01:06:40]Question for logic. Bro is cooked.

[01:06:44]Am I? Bro, I feel like I am. I am very close to the logic though, bro.

[01:06:50][ __ ] it. We're not going to even read the fourth question. It's Yo.

[01:06:58]So, Oh my god, bro.

[01:07:01]Just do we just jump 17us queries we have goddamn 10 to five queries 10 to five queries.

[01:07:24]What if every query makes us go one left? That is not correct. Right? That is not correct. One left from 17. You can't go left. You can go -4. -4 can go to left.

[01:08:02]Yeah, this question is crazy, bro. 23 minutes. I need to think of a new approach, bro, before I run out of time.

[01:08:08]Going to clean the ass, bro.

[01:08:13]So, it's Yo, from Oh my god, bro.

[01:08:19]From 17 Yeah, we can't be doing that. We can't be doing that, bro.

[01:08:40]70.

[01:08:42]Do we [ __ ] me, bro.

[01:08:51]So my approach was just either use closest or directly jump. This is saying if you can't use closest take one jump but if you take one jump for every query that is going to give us a T. But of course if you take a single jump for every query wherein we can't use closes that's going to give us T in the worst case loop.

[01:09:17]What?

[01:09:21]What?

[01:09:26]What, bro?

[01:09:28]Yo, Chad, am I cooked, bro?

[01:09:32]I'm not in a mood to solve it, bro. What? Do premp computation, bro.

[01:09:44]by maybe because I'm speaking slow. Maybe because I'm speaking slow, bro.

[01:09:52]How - 12 - 4 Hold on.

[01:10:20]Hold on, bro. Hold on, bro. No way. I'm not cooking. Yo, chill, bro. I think Okay, hold on. V vector in PS.

[01:10:52]Okay.

[01:10:55]This stores the cost of going from going from index i to index 0.

[01:11:09]Okay. And we can just say ps is going to be of size n comma 0.

[01:11:17]Right.

[01:11:19]We can just say int i = to 1 i less than n i ++ just write the logic here.

[01:11:33]If if I don't think so we need the [ __ ] of moves here then. I don't think so we need [ __ ] of moves here then. If closest of I equals to cost till zero closest of I equals to I -1 equals to equals to I -1 okay then you can say cost till 0 equals to A left cost plus cost till 0 of I minus one. Okay, correct.

[01:12:26]Fair else in cost would be absolute of error of Y X - Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y - X is the same thing.

[01:12:45]error r of i - error r of i - 1.

[01:12:53]Then you can just say cost till 0 of your current index equals to cost plus cost till 0 of i minus one. Fair enough. Fair enough. Now cost till n.

[01:13:08]Now same [ __ ] for cost till n.

[01:13:12]Same [ __ ] for cost till n is equal to i + 1 to cost greater than equals to 0 i - okay now cost equals cos till n of i = + i + 1 co till n.

[01:13:59]Now the whole part is for auto p of query.

[01:14:09]For autop of query, int l= to p 0 in r = to p1, bro. Int= to p1. If l= equals to p, answer dot push back.

[01:14:30]No, no, no, no. Okay, chill, chill.

[01:14:33]Answer dot push back zero. Now if L is less than P then that means you have to go till L R. If L is less than R cos till N L say int A equals to cost till N of L. Int B equals to cost till N of R. answer dot push back answer push back B minus A. I hope that is correct or we might have to do I think this should Yeah.

[01:15:24]Else if else if else if else is case r in A equals to cost till 0 equals of L int B = to cost till 0 of R. Now B minus A minus B A minus B case may be A minus B A minus B that's it I guess what if closes to = - The word costal 0. Okay. Coal 0 of I equals to 1.

[01:16:40]Cost zero of I. Yo Chad I think this is correct bro.

[01:16:47]queries Q U E R I E S Bro I can't spell yo 14 minutes don't act lead code beat your ass bro if L equals equals to P what okay it's R it's R 625 413 Chill Bro, I'm Yo yo yo. Wait, wait, wait, wait, wait, wait, wait. Bro, I'm getting too excited right now. I'm getting too excited right now.

[01:17:25]62 uh 2222 0 413 625 6 is [music] Damn it, bro. I got no water, bro. Yo.

[01:17:52]Yo.

[01:17:54]God is good.

[01:17:58]Chad, we did it, bro. We did it. We did it. We did it, bro. I Bro, I was writing such a [ __ ] code as compared to what the hell this question needed, bro.

[01:18:13]Silly guy. Bro, what? Okay, you're talking about this. Okay, bro. Bro, I wrote such [ __ ] code, bro. In the end, it was nothing, bro. In the end, it was nothing. I gave up on that. Yes. No, sir.

[01:18:30]Bro. Yeah. Okay. I was doing way stupid [ __ ] bro. Contracts, buddy. Hard work payoff. Yo, sir. Thank you, bro. W No panic. Exactly, bro. I didn't panic today, bro. I didn't panic today, Chad.

[01:18:44]That was a good thing, right? I didn't panic. Was that not a good thing, bro?

[01:18:49]Fourth one, bro. Shut the hell up. Easy, bro. I I don't think so. It was easy, but okay, bro. Kish, he's a knight, so he thinks everything is easy. And position I is called fixed point. You're allowed to delete, bro. Is this digit DP, bro? Is this digit DP?

[01:19:09]M should what do you mean by Zephy? Bro, why Chad? I think after finally after so many days I'm going to get a positive rating today, bro. Not DP. It's not digit DP. Then we can't do it. We can't do it, bro. You're allowed to delete any number of elements from the array. After each deletion, the remaining elements shift left and indices are reassigned.

[01:19:31]Starting return an integer maximum number of fix points that can be achieved. Holy.

[01:19:37]No, no, no. We're not even trying you.

[01:19:39]We're not even trying you, bro. We are done for the day. Done for the day.

[01:19:49]Bro, who even does PD? Bro, who even does PD? My brother. Who even does PD?

[01:19:59]Yo, bro. I'm happy.

[01:20:02]Yo, I'm happy, bro. I'm happy today, bro. Hats off to your education status, bro. Love you brother. And for third one prefix. That's it. That's it. Prefix.

[01:20:14]Suffix. That's it. That's it. You're reading comments for the correct approach and celebrating.

[01:20:21]It's me Rupali 827. Honestly, did I take help of chat? Rupali, bro.

[01:20:32]Honestly, I I think I did. I think I did.

[01:20:37]But the point, man, I don't even know, bro. I don't even know. I don't even know, bro. But the third one with a little bit of hints. First time rank under 4K.

[01:20:47]First time rank under 4K. What is my rank? 5.8K, bro. 5.8, bro. I'll lose rating today too, bro.

[01:20:59]I'll lose rating again.

[01:21:03]Yo, lead code is not made for me, bro.

[01:21:05]I'll lose rating again today.

[01:21:09]Yo, are you Shranjan?

[01:21:12]Bro, this is that guy on LinkedIn, right? Are you Sharanjen, bro? I think I know him. He's on my LinkedIn. No, no, no, no. He's some N. He's He's some cheater, bro. this that I use.

[01:21:30]Yo, my project didn't get a slot.

[01:21:35]Yo, bad bad day. Bad day. Never mind.

[01:21:38]Never mind.

[01:21:40]That doesn't come under help, brother.

[01:21:42]Honestly, I don't know, bro. Fourth easy solution. Fourth solution.

[01:21:49]Yeah, bro.

[01:21:54]I'm losing rating, bro. I want to kill myself, bro. I want to kill myself, bro.

[01:22:00]Blood off my bro. The contest has not ended. The contest is not ended.

[01:22:06]We still have 9 minutes. We still have 9 minutes.

[01:22:11]We still have 9 minutes, bro. Got two penalties. Same, bro. Well reading, but it's live though. Practice more, bro. Do we check entrance hubs?

[01:22:22]Do we check entrance hub?

[01:22:27]Bro, even in today's contest, I'm losing rating. That's crazy, bro. Kavish, bro, how much are you gaining? Kavish is getting minus.6 and his rank is his rank is 3,000 and he's losing rating, bro.

[01:22:44]He's 1898. He has a higher rating than me and he's loot, bro. I'm getting minus 10 today. I'm getting minus 10 today, bro. Yo, minus 10. [ __ ] me, bro. Leave code, bro.

[01:22:59]Not a good day, bro. Not a good day, bro. Your favorite company is JP Morgan Chase, right? Abso [ __ ] lutely. I'll work there without even any pay, bro.

[01:23:08]I'll work there without even any pay.

[01:23:12]Hats off to your determination, Goku, my brother. Finally. This [ __ ] always makes fun of my hairline. This [ __ ] always laughs at me. But today he is doing that. Thanks, brother. We like that. Remove bloody screen, bro. After the contest ends. Only then, bro. After the contest ends. Only then. After the contest ends, bro.

[01:23:37]Caffeine codes. Anxious. Minus 13.

[01:23:41]Minus 13. Yo, bro.

[01:23:46]Chad, this is two days old monster.

[01:23:48]Should I drink this? Should I drink this?

[01:23:54]Bro, Monster is disgusting. I wasted my money. Stop caring about rating, bro.

[01:23:58]Let it just enjoy.

[01:24:01]Chad, should I stop caring about rating, bro? Should I become mature and stop caring about rating?

[01:24:07]Should I stop caring about rating, bro?

[01:24:10][ __ ] no, bro. I care about rating. I want to reach guardian on lead code. I want to reach 2,000. I want to post on LinkedIn. I want to flex. But I think I can never, bro. With my stupid ass brain, I can never, bro. I can never.

[01:24:23]Every contest I just get more frustrated despite solving questions.

[01:24:28][ __ ] me, bro.

[01:24:31][ __ ] me, bro. JP Morgan play Indian brown boys, [laughter] bro. You seem to be like an employee of JP Morgan, bro. You seem to be like an employ.

[01:24:52]Yo, nice work, bro. GG's. Nice work, bro. Nice work. Unless you reach Guardian.

[01:24:59]Unless you reach Guardian. Yeah, bro.

[01:25:02]The Norwood 4 ain't changing now. The Norwood 4. Yo, I need to change my bio, bro. N bro, you can't see, bro. It's going to take me one more year, bro. And the point that with with my job, I just can't do lead code. Chad, we are changing this today. I have a Norwood for receding hairline. What do we keep this? Or do we keep this?

[01:25:27]Read me. What do we keep this? I have a Norwood for receding hairline.

[01:25:32]Let's let the contest be over. Then we'll change this depending on how much rating did I lose, bro. How much rating did I lose? How much rating did I lose?

[01:25:43]Autohat.

[01:25:47]Oh, okay. Fair, bro. We can do that. We can do that. Let's just not go on code.

[01:25:55]We can do that. Let me just cl my solution.

[01:26:01]6K, bro.

[01:26:06]6K, yo.

[01:26:10]Six. Oh my god, bro. Oh my, bro. How are people so good at DSA, bro? 6K.

[01:26:18]Oh, [ __ ] me, bro.

[01:26:22]So, I technically solved the YoYo. So, I technically solved the three questions in 1 minute. 26 6.1K.

[01:26:32]Oh my god, bro. Chad, let's stop caring.

[01:26:36]Third was simply prefix suffix. Bro, I was doing an entirely different approach. I was doing an entirely different approach.

[01:26:45]Entirely different approach which I realized after failing that test case 5.8 Amit Kumar, stop flexing, bro. Stop flexing. So, you're telling me you woke up late yet you got a better rank than me? Stop flexing, bro. Stop flexing. You give contest on other platforms. No, bro. Chill. Mine is 10k.

[01:27:11]That makes me happy. No, I'm joking.

[01:27:14][laughter] Just good at cheating. Yeah, bro. I don't even know. Please refer me to JP Morgan.

[01:27:21]Put this. Okay. There's nothing left named as rating after AI. Okay. Rank one is a cheater and works at Cape Germany.

[01:27:31]Let's let's have a look. Bro, Raven, my brother. Cape Jimmy software engineer.

[01:27:37]He has 12 followers. Who the hell is following him? Bro, Dwanchi Aarwal. Bro, Dwanchi is a female and she's following a cheater, bro. Dwanchi, why do you do that?

[01:27:49]Why do you do that? Chad, let's message him though. Let's message him. Let's message him.

[01:27:57]Let's message him.

[01:28:00]Chad, let's message him.

[01:28:03]Uh, connect.

[01:28:05]Add a note.

[01:28:08]Good morning, sir.

[01:28:11]saw that you are all world rank one on lead code weekly contest 500.

[01:28:24]Please make me your disciple. I want to be better at DSA. Thanks. Chad, do we send this? Chat, do we send this? Bro, please don't send any creepy messages.

[01:28:38]Yo, when the hell do I when the hell do I send creepy messages? Bro, you're making me sound like a creep. Shut up, bro. Shut up, bro. If you like watches and suggest me a good watch my father on his birthday. Yo, good question, bro. Do you want to see what watch did I buy?

[01:28:53]What watch did I buy, bro? What did you buy?

[01:29:02]Chat. Chat. Morning spelling. Okay, we'll change that, chat. But after my first salary, I bought this watch for myself. This is for sale, bro. And I think this is a very cool watch. Is this good or is this nice or bad, bro?

[01:29:17]Chad, is this is this good or bad? Be honest. I think it looks cool, bro. I think it looks cool. You got job at JP Morgan. Nah, bro. I want to work there.

[01:29:27]I want to work there. Nice watch. Yes, sir. Yes, sir. Yes, sir. Yes, sir. This looks really good. And this is under 10k. So you don't even have to spend 15k, bro. Whosoever ask, bro, I'm sorry.

[01:29:40]I forgot your name. But this is under 10k, bro. I really like this watch, bro.

[01:29:47]I really like this watch. Good taste.

[01:29:50]Thanks, brother. Only night can be this watch. No, I'm joking. I'm joking. I'm joking, [laughter] man. It's loaded now, bro. I bought it using my first salary. That's how I bought it. NK for that. A bit less than that. A bit less than that. A bit less than that. Buy a silver X. No, bro. I'm never buying anything less than that.

[01:30:11]More after this, bro. It is expensive as hell. It is expensive as hell. Not a watch fan, though. What do you mean?

[01:30:20]Morning, sir.

[01:30:22]Saw that you're all world rank on lead course. Please make me a disciple. I want to be better at DSA. Thanks. Do we send this Rolex next after years? Yo, chill, chill, chill, bro. In third one test case hard accept but afraid. Nah, bro. I hard code all the time. Chill. I hardcode all the time. Chad, we are sending this three personalized invitations remaining for this month, bro. I'm wasting my personalized invitation.

[01:30:50]Send, bro. Send. Send. Let's send this.

[01:30:58]Let's send this, bro. Let's send this.

[01:31:01]Don't raise him. Please don't. Bro, why not? I'm just asking for I'm just asking for like help, bro. I'm just asking for help from my brother. Why not? I was thinking cash or fossil. Yeah, bro.

[01:31:17]Casio. Bro, Casio. It really depend, bro. I got my dad this Casio 169 AW WA.

[01:31:28]I got my I got my father this one. I got my dad this watch.

[01:31:37]I think it looks cool, bro. But yeah, this is way less than your budget. You can buy more than that. That's 99.99% cheater, bro. We can still ask him. We can still ask him if I watch you tomorrow on Saturday to means 2.3% of my life is watching your stream. Bro, see how much we all love you. Caffeine's my brother. This guy just said you spend 2.3% of his life watching me.

[01:32:02]Yo, I didn't think so any girl would ever do that for me. Caffeines, bro. I love you, bro.

[01:32:15]Will you check out a project I'm working on? Yeah, bro. Send it. Send it. Is the contest over? Send it, bro. Is the contest over by weekly? Yo, weekly is over. Weekly contest is over. Chat, do we start by discussing the solutions?

[01:32:36]Do we start by discussing the solutions?

[01:32:38]Who is in 2.3% of 50 people is one whole life bro? First of all, 2.3% is an overexaggeration.

[01:32:48]And to top it off, And to top it off, I'm not going to stream for an entire lifetime, bro.

[01:32:59]Okay, bro. Let's just check entrance of them. Let's be a man, bro. I need to become a man, bro. I need to not be scared.

[01:33:06]Akinit, bro.

[01:33:09]Ajin, bro, didn't he sleeping. He gooned last night and slept, bro. Anybody who misses contest because he's sleeping is a goddamn tier one gooner. Let me be honest with you. CF digit DP question.

[01:33:21]Yo Jason, we can do that. Chill, chill, chill, bro. Chill.

[01:33:25]Hey bro, how are you do? Do you remember me? Kan Guriwal one111. Yes brother, I do remember you. What's up? What's up?

[01:33:34]Start with a con profile, bro. Tell me your profile. Amit 6 AIT 9. Six amit nine was getting plus 10. Holy [ __ ] I'm jealous, bro. I'm jealous. I'm jealous.

[01:33:52]Yes, my brother. With the 100 rupees donation plus 31. Yo, my brother. Yes, bro. Yes, bro. DM me on Instein. You'll get my private hairline pictures. You'll get my private hairline pictures.

[01:34:07]Okay. Just because you send a super chat, bro, DM me on Insta. I'll send you my private. Love you, brother. Love you, brother.

[01:34:20]Yo. Okay. You live in a mess or something. You live in a mess or something. You live in a mess, bro.

[01:34:25]Third was hell. So long implementation now, bro. It was just me. It was just prefix some suffix some. Yeah, Zephy, bro. Send me a project. Send me a project. Send me a project, bro. Yo, worth it. Yo, did did Sarthk not attend today's contest or what?

[01:34:43]Yo, Sarth did not even attend, bro.

[01:34:47]Suk is sleeping, bro. Sik is sleeping.

[01:34:49]Also want hairline pics of you, but from bottom.

[01:34:55]Goku.

[01:34:57]Goku, brother. Find God at this point.

[01:35:00]Just just find God, bro.

[01:35:03]Just find God. Oh, hell no, bro. If you don't send super chat then it doesn't mean we don't love you. Even we deserve private hairline photos.

[01:35:11]The point is you guys will leak it. You guys will leak it, bro. You guys will leak it.

[01:35:16]You guys will leak it. I know. Yes, bro.

[01:35:19]Will not leak it. Plus 31. Yo, bro. What is your What is your rank, bro? The link is not being sent, bro. Bro, probably send it in the Discord. Send it in the Discord. Send it in the Discord. Check mine also. They supercharge. Yeah, bro.

[01:35:36]Come to Delhi. Geeky Anu.

[01:35:40]Geeky Anu. Plus 28. I'm jealous as hell, bro. Plus 28. He did three questions in godamn 30 minutes.

[01:35:51]Oh gosh. Geeky, bro. The [ __ ] is How is you so good, bro?

[01:35:58]And I went into the complete wrong direction at the very start. Bro, let out your real voice, not this boy was >> this is not real, bro. [laughter] >> Shut the up, bro. The other guy was a gooner and Saruk ain't that rating racism right there. What are you even talking about? We jump to an index that has sum of difference and consecutive.

[01:36:26]No, bro. No.

[01:36:28]Bastard we jump to an index that has sum of difference and consecutive close jump less than direct difference. The [ __ ] is bro what is bro yapping?

[01:36:38]What is bro yapping? Abdul Rahan 2006 2806 class 80.

[01:36:48]How is he ran 533 if your duration was 16?

[01:36:53]Yo, what? What is this guy doing, bro?

[01:36:57]What is this guy doing? Abdul Rahan 2806.

[01:37:01]What is his Abdul Rahan? My brother.

[01:37:06]My brother. You took one hour. Okay, you solved all four question. Maybe that's why. Maybe that's why. Well, that's crazy as hell, bro. That's crazy as hell.

[01:37:20]All killing Singh, bro. What do we B? What do we What do we Bro, bro, what? Abdul Rahan, bro.

[01:37:36]Bro, it's insane. Minimum fixed points after deletion. Minimum cost. Bro, this is the minimum cost, right? Minimum cost to move between indices.

[01:37:47]st yo yo bro writes really clean code chat no honestly bro respect that's crazy I don't think so I want to slow sleep again please yellow bro I paused ads bro said it and we paused ads the Ads have been paused. Ads have been paused, bro.

[01:38:19]Chill. Ads have been paused, bro. Tell me this is good. We have no code.

[01:38:26]Okay, bro. People want to see my code.

[01:38:28]People want to see my code, bro.

[01:38:33]Look at my code for the third question.

[01:38:36]Minimum cost to move between indices, bro. Just show me the goddamn question, Chad. This is how I did the third question. Good or bad? See, I was using this logic. This is all redundant. I was using this moves logic. Get this out of here. This just calculates the closest.

[01:38:59]Uh yeah, we don't need this either, bro.

[01:39:02]We don't need this either. Chad, I wrote such a [ __ ] logic earlier. Look at all this commented out logic here. But in the end, in the end, all we had to do was calculate two errors. cost till zero and cost till n. This stores the cost of going from index i to index zero. Okay, from any index I, how much cost will it take to go to index zero? The logic here is if the closest of any number is equals to its left number then add this then the its costal zero would be 1 plus coal zero of the left index.

[01:39:40]else cost still zero you can see mean I mean chill chill chill bro explanation is the tough part I hope you guys understand if you don't I can explain this then you calculate the cost till n cost till n from any index i to cost till n and then just just subtract if you want to go from a to b find the cost of cos n of a cos n of b and subtract them and that is your answer that is your answer. That's how I did it, bro. That's how I did it. Did I over complicate it?

[01:40:16]Hey, bro. You're a rain man. When I started watching your stream, my performance dropped. Get some good luck and do good things in life. Not visiting incognito. Yo, papia, just because your ass, you're blaming it on me. Just because you're an ass, you're blaming it on me. You looked really tired while solving third one. And once you killed it, then loved your smile. You look good when smiling, bro. Status, bro. At this point, just marry me, brother.

[01:40:43]Just marry me, bro. Nobody has given me compliments like those like status gives. How's my guitar cover? Should I post more? Show your guitar cover, bro.

[01:40:52]Show your guitar cover. Let's rate Whipple's guitar cover. Whipple, bro.

[01:40:57]You haven't even posted anything, bro.

[01:40:59]You haven't even posted anything.

[01:41:01]Discord post where did you post? Building in public daily develops simple explanation copy link let's devium learn development through real experiences and projects a platform with learning path okay bro what is devm everything you need to learn build bro as a developer real developer experience resources learning open source built in public the commands I build in public okay bro okay okay what even is this about architecture is complete completed content will Okay.

[01:41:39]Okay. Read logs.

[01:41:42]Daily logs of what I'm building. DS practice and learning bugs I hit and how I fix them. This keeps me consistent.

[01:41:48]What a typical log looks like. What I worked on. Okay. Okay, bro. Where where do I pick a date? Yo, bro. Okay. Okay, I guess this is 2026 1 9 had college from 8:00 a.m. to 4 p.m. had a similar idea that I'm working on but nice one started finished it could not complete the DevOps lecture turbo repo this guy is crazy bro is learning turbo 31 January this page could not be found honestly bro idea bro nice idea nice idea nice idea bro it's bad it's on Insta Pull bro what's your Insta profile Bipple, bro. Tell your Insta profile.

[01:42:35]Tell your why you have so thick lips.

[01:42:39]User NZ7 CB6J E5W.

[01:42:43]Bro, the [ __ ] do I do if I have thick lips, bro? The [ __ ] do I do, bro? My rating is falling. Like for me, like that one girl ain't able to solve all four questions. I know I can't know the solution, but always run off time.

[01:42:58]Any opinions, bro? My rating falls every time too. My rating falls every time too, bro. Who are you asking? Some bucks to be fixed. Yo, Zeffy, bro. Nice [ __ ] bro. Nice [ __ ] Star on GitHub. Bro gets my star. Bro gets my star.

[01:43:17]Bro gets my star. It's in Typescript.

[01:43:20]Nice work, chat. Check this out, bro.

[01:43:24]150 commits. Holy [ __ ] 150 commits, bro.

[01:43:30]That's crazy. That's crazy. Rating falling harder than hair.

[01:43:35]Yo, I can't even lie, bro. That might be true. That might be true. Chad, is my solution good for this one? That's it for then, bro. Explain three in Google Meet.

[01:43:48]Do you Do you want Do you guys want me to explain the third one? I think people know it now. I think people know it now.

[01:43:54]I will take you to barbecue the day I got placed. Caffeine score broke. Don't forget about it now. Don't forget about it now, bro. Your your conju ass should not forget about it. But once I'm done building and deploying my startup MVP, I'll tell you first. Sure, bro. Sure.

[01:44:10]Sure. Night rating. 1850. 1850. I'm about to lose my night rating. I'm about to lose my night rating.

[01:44:19]About to lose my night rating. Scribble, bro.

[01:44:23]Bro, people want to play Scribble.

[01:44:26]Okay, bro. We can play probably one round of scribble after seeing Vipool's guitar cover. Bro, bro is a child. He has women drooling all over him. Let's listen.

[01:44:39][music] Oh, I like the story, bro. I like [music] [music] this actually.

[01:44:58]Bro, bro, I know you're trying to attract women and I think you're successful in it because you attracted me, brother. That was nice. That was nice, bro. That was nice. You're a man and Java developer, bro. I'm DevOps. I I'm DevOps and Phops. DevOps and Phops.

[01:45:16]Copyright, [ __ ] Bro, we got copyright.

[01:45:23]Anyways, don't earn anything, chat.

[01:45:24]Looks at Let's look at my revenue, bro.

[01:45:27]Let's look at my revenue. How much did I even earn? How much did I even earn, bro? Let's look at my revenue.

[01:45:34]Let's analytics. Let's go to uh revenue.

[01:45:40]Let's go to revenue of of lifetime.

[01:45:49][ __ ] Go chanting. I guess. How much did I learn? How much did I earn, bro? How much did I earn?

[01:45:58]It's [ __ ] By the way, I got two three hes from that. I know, brother. I need to learn to play guitar, too, bro. That's probably the only way I can attract women, bro. $10 7 10,000 10,000, bro.

[01:46:21]We earn goddamn $88 8.87 USD to INR 840 rupees and the point that I can't even [ __ ] redeem it. I can't even redeem it, bro.

[01:46:40]I can't even redeem it. 843 rupees and that is crazy, bro.

[01:46:47]YouTube pays peanuts, bro. YouTube pays peanuts.

[01:46:52]Crazy. Hey bro, you can get a Napoleon pizza 840 rupees only if I can't even redeem it, bro. That's the point. I can't even redeem it, bros. Loaded. I'm loaded from down there. I'm loaded from down there. Down there. Down there. But yeah, let's play scribble and end this chat. Let's just play scribble and end this.

[01:47:15]Create private room.

[01:47:18]Okay.

[01:47:20]Draw time would actually be let's keep the draw time as uh 20. Let's keep draw time as 20. Rounds is two. Game mode is uh players let's keep players as uh like 15 or 20. Word count equals to five words. Hint, I think only one hint, bro. If you're a man, you you're not going to use hint.

[01:47:45]You're not going to use hint.

[01:47:49]Bro, practical. See you soon. Bye-bye, bro. Bye-bye. Bye-bye.

[01:47:53]30. Yo, 30 is too less. 30 is too much, bro. 30 is too much. Let's keep it 20, bro. Let's keep it 20.

[01:48:03]Let's keep it 20, bro. Now he's showing his dashboard. Literally breaking every policy. Yo, it's me, Rupali 827.

[01:48:13]You're talking about me showing this?

[01:48:15]You're talking about me showing this?

[01:48:17]It's me, Rupali 827.

[01:48:20]Brother or sister for my names? You sound like sister.

[01:48:25]Nobody can do [ __ ] about me showing my dashboard. It's my dashboard. What the [ __ ] is YouTube going to do, bro? I don't give a [ __ ] if YouTube doesn't, bro. YouTube don't have any policy.

[01:48:34]YouTube can't show me to show my revenue. I will show my revenue, bro.

[01:48:38]Like, stop acting like a Ken or something, bro. It's me, Rupali. I don't give a [ __ ] It's my dashboard. It's It's not some intellectual property that I can't show, bro. The [ __ ] No way. That sister. Yo, I don't know, bro. I don't know. But the fact that I'm showing my dashboard and she's like, I'm breaking policy. What?

[01:49:03]Ads have been delayed. Ads have been delayed. Sister from another mother.

[01:49:08]Yeah, bro. But I just don't get it. It I'm just showing my dashboard. How does that make like an issue of it? Why do you have to make an issue on it? All killed in today's contest. Now, we did we did only three. We did only three. 20 seconds, chat. 20 seconds. Let's invite.

[01:49:29]Yo, bro. Bro, don't be disrespectful.

[01:49:31]Don't be disrespectful, bro. Don't be disrespectful, chat.

[01:49:36]Don't be disrespectful, bro. That's That's bad, bro. We can't say that, bro.

[01:49:41]add.

[01:49:51]Yo, join up before we start. Join up before we start. Solve. Let's go. How many did you solve, bro? I've done two.

[01:49:59]Lol. Well, that's not bad, honestly.

[01:50:02]That's not bad.

[01:50:06]It's not bad. Link, bro. It's in the chat, brother.

[01:50:13]Yo, I'm about to start. I'm about to start. Join if you want to join. I'm about to start. Brave hack.

[01:50:22]Sure. Sure.

[01:50:26]Okay.

[01:50:28]3 hours sleep and playing the same brother. Same. We are starting. We are starting. Round one. Whosoever teaches us bro. Elect us bro.

[01:50:38]Okay. It's just 20 seconds. Be fast.

[01:50:42]Be fast, bro. So why big YouTubers don't reveal their bro? Because I don't give a [ __ ] I'm not a big YouTuber and I can reveal Rupali, bro. Chill. Okay, I I won't be mean, but please chill, bro.

[01:50:54]Chill.

[01:50:55]I guess it's easy, bro. Nice drawing, Rupali. Brother or sister, I don't [clears throat] care what big YouTubers does, bro.

[01:51:02]I do it. They don't want to show it because they earn a lot of money. I don't I don't Nobody can stop me from showing my dashboard. It's my dashboard.

[01:51:12]If I want to show it, I will.

[01:51:15]Chand papia. Yo, Chandia.

[01:51:19]This guy is fish.

[01:51:23]Fish fish.

[01:51:27]Yo, be fast, brother.

[01:51:30][clears throat] Finland. Fish grill.

[01:51:35]Fish and chips.

[01:51:37]Damn.

[01:51:39]Yo, that's nice drawing. Honestly, bro, that's nice drawing. Honestly, that's nice drawing.

[01:51:48]Yo, bat.

[01:51:54]Why? Oh, I know it. I know it.

[01:51:57]I didn't guess it.

[01:52:00][clears throat] Weird.

[01:52:03]beers, bro.

[01:52:10]Bro is drawing a bottle for a baloo. Who the hell was that, bro? Was he stupid?

[01:52:16]Was he stupid? Bro is drawing a like a bottle for a baloo.

[01:52:22]Are we serious?

[01:52:24]Are we serious?

[01:52:29]Yo, hold on, man.

[01:52:32]Men, what is your drawing? [clears throat] Me. Yo, what a nice drawing, bro. Y said foot. Sh. Bro, just give up, bro. Just give up. Chan papia says legs. Chan papia, you're so ass, bro. Saying legs, bro. Saying legs, bro. Imagine, bro.

[01:53:00]Saying legs.

[01:53:06]>> [music] >> Why are the words so easy? Why are the words so easy, bro? You going to rap for his 8 USD? Bro, we can't even redeem it.

[01:53:16]We can't [clears throat] even redeem it.

[01:53:19]You can't even redeem it.

[01:53:24]Chan Papia. Chan Papia, bro. Show me what you got, bro. Show me what you got.

[01:53:30]Okay.

[01:53:32]Okay.

[01:53:34][ __ ] is this?

[01:53:37]What is this?

[01:53:41][clears throat and cough] What is this, bro?

[01:53:49]Yo, my brother, such an ass drawing.

[01:53:54]Like, bro, people can't draw in the chat. Chanpaky, unique, funny name. What is your code forces rating, bro? I don't do good forces. I don't do good forces.

[01:54:02]How do you solve third question? Can you guide me, bro? Prefix sum, suffix. You just have to maintain a prefix sum and suffix sum. That's it. I I'll tell you after this. I explained it already, bro.

[01:54:13][clears throat and cough] Bomb grill bar. Oh, I know it. Barbecue. [music] Garbage.

[01:54:27]Garbage.

[01:54:29]Good drawing, bro. Geeky, I'm sure you're calling that good drawing, bro.

[01:54:32]That drawing was garbage. That drawing was actually garbage, bro.

[01:54:38]Sprinkler. Okay.

[01:54:43]Okay.

[01:54:46]Yo, what is this, [clears throat] bro? What? What? Boiling.

[01:54:55]Boiling.

[01:54:58]>> [music] >> Yo, this guy. Who the hell was that, bro? The worst drawing in the history of humanity. Is that how a toilet looks in your home, bro?

[01:55:11]I give my first weekly contest. Nice work, bro. Nice work. Hey, bro. Someone fake is playing from my side.

[01:55:18][laughter] He was, bro. Hit chance bro is being sail sail sailing [music] flag pole bro that's a tough word chan papia bro if you don't attend code versus code chef don't call yourself a competitive programmer the [ __ ] when did I call myself comp competitive programmer bro it's me Rupali are you just here to rage bait me bro are you just here to rage rate me show me one time when I called myself competitive programmer Bro, show me one time.

[01:55:55]Yo, chicken.

[01:56:01]The [ __ ] is this?

[01:56:05]Bro, why are you drawing it in? [ __ ] is that? Exactly. Bro, what are these people doing?

[01:56:14]Bro, three people in the corner surely cheated. Of course, bro. Of course they did. They did.

[01:56:20]What are these words, bro? Yeah, you're kind of right. These words are trash, bro. Apple.

[01:56:30][clears throat] Yeah, YouTube.

[01:56:35]YouTube top.

[01:56:39]Why the [ __ ] did bro draw an apple?

[01:56:44]Why did he draw an apple?

[01:56:47]Bro, is he stupid?

[01:56:50]Bro, is he stupid for stream Among Us today? Yo, I've never played Among Us after 2020. I've never played Among Us after 2020. Sh has guessed it already. [clears throat] What's this, bro? It's Bro, am I ass at this point, too?

[01:57:15]Bro, I'm I know you will say a thing after reaching 21. Yo, it's me, Rupali. Holy [ __ ] bro. Hop on Discord, bro. We got a chat. Hop on Discord. Hop on Discord.

[01:57:27][clears throat] Hop on Discord. See us, bro. Love you, brother. I guess B.

[01:57:35]Yo, who is this? Who's drawing, bro? FF, bro. Draw fast. We don't have time, bro. Is drawing like his grandma.

[01:57:45]>> [clears throat] >> drinking mug desperate.

[01:57:52]Bro, why are you even choosing words like these, bro? Why are you even choosing words like these?

[01:58:03]Oh.

[01:58:08]Oh. Okay. Okay. Hot dog. Hot dog. Hot dog. Hot dog. Yo, nice drawing, bro. Who was this? Norwood 6. Norwood 6, bro.

[01:58:20]Yo, bro, next time, bro, please don't keep names like these, bro. I might have to ban you. Norwood 6.

[01:58:28]I hope you're talking about yourself.

[01:58:31]You too, Chandi. Hey, Rupal. You're the person which no one likes.

[01:58:37]Oh, there's a beef going on.

[01:58:42]I don't know. I [clears throat] don't know. [cough] Dump it on guessed it.

[01:58:50]Pigeon.

[01:58:52]Yo, how are people actually guessing this? This is crazy, bro. How are people actually guessing it? Patrick is choosing a word. What was that? A pigeon exactly, bro.

[01:59:07]Bro, what this is R S road [clears throat] bill.

[01:59:29]Okay, I mean fair enough. What could he even draw for a bill? What could he even draw for a bill?

[01:59:36]What could he Okay, very interesting name here, bro. Very interesting name here. Let's see what this guy has. Don.

[01:59:44]I'll call him Don. O diamond. L plus O diamond.

[01:59:49]Draw. Bro, you don't have time.

[01:59:52]You don't have time. P.

[01:59:58]People have guessed it already.

[02:00:03]Bro, Geeky and Shu. Yo, is Geeky and Shu cheating? Is Geeky and Shu cheating, bro?

[02:00:10]Bro, is Geeky and Shu cheating?

[02:00:15]Yo. Okay, it's for me. It's for me.

[02:00:16]Chat, don't cheat, bro. Don't cheat.

[02:00:23]Oh [ __ ] I didn't get to choose a word.

[02:00:27]Yeah. See, they've guessed already, chat. What do I draw for this? What do I draw for this? Okay, [clears throat] bro. What do I even draw for this, bro?

[02:00:38]Bro, what?

[02:00:42]I knew you. Was that a good drawing? Was that a good drawing from my side?

[02:00:49]Was that a good drawing? Triangle.

[02:00:52][laughter] Bro, all these are watching stream.

[02:00:56]Exactly. Bro, they're cheating.

[02:01:00]Alex, bro, stop cheating.

[02:01:05]Yo, bro, choose the easiest word. Anyone here? S for Bro, you didn't you didn't attend to this contest. Bye, bro. I'm going to sleep. Yo, bro. Me, too. I'm also going to sleep after this one.

[02:01:19]I'm also going to sleep after this one.

[02:01:22]Good drawing, bro.

[02:01:24]Watch this now.

[02:01:29]Eggplant.

[02:01:30]Eggplant.

[02:01:32][clears throat] Bandage.

[02:01:35]Broken heart.

[02:01:37]Heartbreak.

[02:01:40]Bell pepper.

[02:01:43]How? Bro, is Geeky Anu a goddamn like spellbe master or what? Geeky Anu. Bro, stop cheating.

[02:01:51]Stop cheating, bro.

[02:01:58]What's crying emoji?

[02:02:04]Dumpy. Don't laugh.

[02:02:08]Yo, what? People can't believe this.

[02:02:11]This [ __ ] is easy, bro. This [ __ ] is easy.

[02:02:16]That was not a laugh gang. That was Sh, bro. That was shash drawing.

[02:02:23][laughter] Yo. Yes. Chill, bro. Chill.

[02:02:31]Crown. Crown. That's what we like to see. [clears throat] I couldn't solve for food, so no submission.

[02:02:38]Oh, but I hope you got some lessons today.

[02:02:42]It's me, Rupali. Who the hell does she think he is? He or she, bro. Lessons today. Are you my like [ __ ] professor, bro? Got some lessons today, bro. What?

[02:02:53]Bro, he or she is just rage baiting me at this point. I hope you got some lessons today. The [ __ ] do you mean by lessons, bro? Who is you?

[02:03:06]Hold on.

[02:03:10]Yo, [clears throat] how geeky, bro. Bro, should we kick geeky and shoot lantern? Yo, should we kick Geeky and Shu, bro? If he's in the chat.

[02:03:25]Yo, Chris Bumstead, you're such a goddamn s, bro. Look at this simp. Look at this goddamn s, bro. He's typing my look at this goddamn s, bro.

[02:03:40]Geeky and bro, stop cheating.

[02:03:45]Medicine. Medicine.

[02:03:48]>> [clears throat] >> What?

[02:03:53]Japan nuclear.

[02:03:56]Oh, ball knowledge, bro. This required ball knowledge, bro.

[02:04:00]This required ball knowledge, bro. Good drawing, bro. Geeky and shoe, bro. Good drawing. If you geeky and shoe, guys, grass tree farm.

[02:04:17]Oh [ __ ] [clears throat] Over R. R. What is R? What is R? Raise.

[02:04:25]Raise.

[02:04:27]Root. Bro, who draws root with green color, brother? Yo, Chan Papria, chill.

[02:04:33]Chill. Chill, bro. Ch. The [ __ ] is Chan typing, bro?

[02:04:42]Yo. Okay. Play, bro. Play.

[02:04:49]Jeez.

[02:04:54]What? [music] Japan.

[02:05:01]People are good, bro.

[02:05:03]Yo, what is Electus? What is Electra typing, bro? What is Electus typing?

[02:05:09]Anything for us, bro? You're such a goddamn s.

[02:05:14]Yo, you're such a goddamn s, bro.

[02:05:16]Honestly, it's meal.

[02:05:19]I don't know. B.

[02:05:22]Yo, nice. You didn't have to add that.

[02:05:26]Dumpy Don couldn't guess it. Dumpy don't go give up. [music] Yo, he did. He did.

[02:05:36]Here we got Chan Papia choosing a word.

[02:05:39]Let's see how good is he at drawing.

[02:05:44]Bat lighter cigarette.

[02:05:53]Wicket [clears throat] wicket. [cough] What is he doing? [music] Chalk.

[02:06:03]Bro, who the hell is using chalk like that?

[02:06:08]Who the hell is using chalk like that? I had a macro. So, bro, why did you paste it there, bro? Hello bro. Woke up 10 minutes late. Skip contest. Yo, today's contest was nine. Honestly, left.

[02:06:19][music] Stop choosing easy words, bro. Stop [clears throat] choosing easy words.

[02:06:25]Stop choosing easy words, brother.

[02:06:28][clears throat] [music] It's Wait, left. Everybody guessed it.

[02:06:34]Chill guy is guessing west. My brother bro is guessing west instead of left.

[02:06:41]Oh, I can never I can never.

[02:06:46][clears throat] You know, you're given the length of word, right?

[02:06:51]Oh, at the top. Yeah, you're right. I didn't realize. I didn't realize.

[02:06:54]Cookie. Cookie.

[02:06:57]I didn't realize. Yo, S. Thanks, brother. Cookie cat. Cookie woman. Oh, what?

[02:07:05]Cookie cat. [clears throat and music] Bis, bro. What? How the Yo, these guys are so ass at drawing.

[02:07:18]These guys are Why did Why did he add a cat? Why did he add a cat?

[02:07:26]TV. TV. TV.

[02:07:28]Monitor display.

[02:07:32]Bro, how are people getting it?

[02:07:34][clears throat] PC, bro. What has an R in it? What has an R in it? Screen. Yo, screen scream length seven cookie bro. Chill chill chill chill. Okay, I I'm dumb, bro. I'm dumb. Look at these guessing. Yo, what was my word? Oh, okay. I thought it was mine.

[02:08:02]C H E C H E Chew Bum.

[02:08:13]Bro, what? This was a gum.

[02:08:18]This was a gum.

[02:08:22]Well, I'm ass this game.

[02:08:26]Bag. Bag Chan is the word.

[02:08:35]Dbag.

[02:08:38]Dang.

[02:08:43]Who? Never in your life draw ever again.

[02:08:46]Never in your life draw ever again.

[02:08:48]Yeah, bro. What even is this? What even is this?

[02:08:54]There was not even a word, bro. There was not even a word.

[02:08:59]Solar panel compass.

[02:09:04]Yo, I guessed it. The f Yo, the first person to guess it was me. Yo, Toast got 725. The first person to guess it was me, bro. First person to guess it was me.

[02:09:19]Bro, why was I kicked? Yo, who kicked you? What was your username, bro? What was your username? Nobody kicked you.

[02:09:26]What was your username?

[02:09:29]What was your username?

[02:09:32]G. [clears throat] Yo, Caffeine, bro.

[02:09:35]What was your username?

[02:09:37]Bro, I Who kicked you, bro?

[02:09:43]I think is choosing. When will my come?

[02:09:46]I'll hide my screen. I'll hide my screen.

[02:09:53]This is circuit.

[02:09:57]She has guessed it.

[02:09:59][clears throat] Upper laptop mouse click. Oh, okay. Honestly, not a bad drawing for a click. Not a bad drawing for a click, bro. What else could he even draw for a click?

[02:10:18]What else could he draw? The only place where people get 12,000. Exactly, dude.

[02:10:22]Exactly. Yo, what? Caffeine, bro. I didn't kick you. What was your username in this game? Black.

[02:10:30]Black.

[02:10:33]Yo, I guess it. I guess it I guess it. I guess it black.

[02:10:40][clears throat] Yo, easy words, bro.

[02:10:45]People are choosing easy words. Yo, if you're cheating, I'm not even joking, bro. If you're cheating, you're going to be king.

[02:10:53]Uh, let's go.

[02:10:57]Yo, look at Alexis the goddamn cheater.

[02:11:03][music] Yo, if you don't guess from this drawing, if you don't guess from this drawing, bro, you're stupid. You're stupid. If you don't guess from this, chat, was my drawing ass? Was my drawing ass, bro? That was good. My drawing was good. Geek and Shu won.

[02:11:23]Giki and Shu won.

[02:11:25]Giki and Shu won. Chan really said, "Bro, he's he's crazy. I was preparing for digit DP and skip to this contest.

[02:11:31]Thankfully, they didn't give digit DP."

[02:11:33]But today's third question was good, bro. Never draw again. Yo, Geeky and Shu, you're a How the hell are you so good? How the hell are you so good?

[02:11:43]That's crazy. Okay, then chat. I think that's the end of the stream.

[02:11:48]Let's meet next week. You could have drawn a crescent moon.

[02:11:56]Fair, bro. Fair. I mean, that's not bad, bro. What I do was also good. What I do was also good.

[02:12:02]Let's meet next week. Good strange, bro.

[02:12:05]Tell me how I studying system design.

[02:12:07]That book system design by Alex view.

[02:12:09]That's it. Moon drawing was ass. Chill, brother. Chill. It was not huge, bro.

[02:12:15]You dump it on, right? Start doing daily code forces live stream. Bro, I I go for a job full time. I don't have time besides the weekend. I don't have time besides the weekend. I'm going to watch Sushi. Yo, [laughter] nice bro. I watch him too.

[02:12:32]Watching a different watching a different from us. What do you mean by that? What do you mean by that? What do you mean by that?

[02:12:41]The what? How did you solve third?

[02:12:45]Well, I told it. Okay, let me just quickly tell it once again. I I solved it using prefix sum. So you maintain two array vector a cost till zero from any index i. How much cost will it take to go till zero and how much cost will it take to go till n right the logic to calculate cost till zero and cost till n is this. Basically if you can use the closest always use the closest else just go towards that direction whatever see if if you can use the closest use the closest and then add the cost of the left one yeah bro I hope you understand if you don't just tell me I'll explain it this is just two three conditional statements together cost till end now in the end if you want to go from L to R find the cost of find the cos till n of l. Find the cost till n of r. Then just subtract it. That's it. That's how I did it. That's how I did it, bro. That's how I did it. That's it.

[02:13:48]Exact. Yo, Rohan gaming tech, bro. I agree. I agree, bro. I agree. I agree.

[02:13:55]I agree, bro. Snashing. Nice. Nice work, bro. Yeah. I'm starting CSS list. I hope I complete in three months. I have to do along along with the job. Good luck, bro. I hope you do it, too. Good luck.

[02:14:08]Good luck. That's it for, bro. See you on Saturday. Then be happy. Keep smiling, bro. Life should really do short status 15141, my brother. Thanks so much, bro. Bro is so wholesome. My username is you asked for it. Check entrance, bro. I'll I'll do it now. Next stream.

[02:14:26]Let's end it right here. Right now.

[02:14:28]You're so good at logic, bro. I'm not.

[02:14:30]I'm not, bro. I took 1 hour 15 minutes, bro. I got positive rating on entrant hub. Bro, what?

[02:14:37]I got positive rating on entrant hub.

[02:14:41]But where is entrant hub?

[02:14:44]Where is entrance hub, bro? How is that possible?

[02:14:49]Bro, I got positive at 5k rank. Did the cheaters were removed or what? Bro, G. Bro, I got Who said it? Bro, who said it?

[02:15:04]Bipple. Whipple. Brother, I'm unfollowing you on Instagram. I'm unfollowing this [ __ ] on Instagram.

[02:15:11]This [ __ ] Yo. And he's laughing. And he's laughing. And he's laughing. I liked his goddamn guitar story. I liked his I followed him on Instagram, bro. I appreciate him. And he's Yeah, bro.

[02:15:26]That's it for That's it. Let's end the stream.

[02:15:33][ __ ] me, bro. Okay, that's it for the stream. Let's meet next week. Bye-bye.

[02:15:39]Thank