Install our extension to search inside any video instantly.

LeetCode practice July 15th 2026

Added: 2026-07-17

239 views83:11:26midnight_simonOriginal Release: 2026-07-16

Digit DP is a dynamic programming technique used to count numbers satisfying specific digit-based constraints within a given range. The technique involves breaking down the problem by digit position, tracking constraints like previous digits, and using memoization to avoid redundant calculations. For the problem of counting numbers where the absolute difference between adjacent digits is at most K, the solution requires tracking the previous digit and the tight constraint (whether we're still bounded by the upper limit of the range). The approach handles leading zeros carefully and computes the count for the upper bound minus the count for the lower bound minus one to get the result for the range.

[00:00:41]Microphone check. One, two.

[00:00:50]All right.

[00:01:02]Are we live?

[00:01:06]I think we are.

[00:01:11]All right, here we go.

[00:01:29]Leak code daily problem. Oh man, more GCD. Wasn't the last one? GCD.

[00:01:38]GCD week, huh?

[00:01:47]Apparently, I saw this not too long ago.

[00:01:50]Dang, three, four months.

[00:01:56]Sum of GCD of formed pairs.

[00:02:01]You're given an integer array nums of length n. Construct an array prefix gcd where for each index i, let mx be the maximum of all the numbers up until that index and prefix gcd equal the gcd of uh nums i and the maximum of i.

[00:02:29]After constructing prefix GCD, sort uh prefix GCD in nondereasing order.

[00:02:37]Form pairs by taking the smallest unpaired elements and the largest unpaired element.

[00:02:45]Repeat this process until no more pairs can be formed. For each form pair, compute the gcd of the two elements. If n is odd, the middle element in the prefix gcd array remains unpaired and should be ignored.

[00:03:00]Return an integer denoting the sum of the gcd values of all foreign pairs.

[00:03:08]I don't know what that just said, but I'm going to look at the example. So 264, the answer is two. Prefix GCD.

[00:03:22]Max is two six two.

[00:03:33]This is an easy problem. Um, first let me make my prefix GCD.

[00:03:45]What are the numbers up to? Only positive numbers. So, this could be zero, I guess.

[00:03:53]Um, wait, what's what the heck is the prefix GCD?

[00:04:13]um gcd of nums eye and the max. All right.

[00:04:22]So we have to keep track of the maximum.

[00:04:24]So now iterate through keep track of the maximum and then the GCD is equal to how does a GCD work? Is it like GCD like that and then we pair them ups or they say sort sort this thing in nondereasing order. So that's just a regular sort.

[00:05:18]And then I'll do a little twop pointer while loop.

[00:05:25]Um, and then what are we doing?

[00:05:28]Smallest, largest, and then the GCD of those two.

[00:05:40]prefix gcd l or I guess we can minus - plus+ plus and then make an answer sir. Sir Lord good. What's happening?

[00:06:06]How are you doing?

[00:06:10]All right, let's see.

[00:06:13]Is that going to work?

[00:06:22]That was pretty easy.

[00:06:25]I don't know why it's medium.

[00:06:29]I guess it's one of the easier mediums because there's nothing. I basically just did exactly what they told me to do, man.

[00:06:38]What the heck is that noise, man?

[00:06:43]Is there a fly in here?

[00:06:50]That's a bee, man. How the hell did a bee get in here? What the [ __ ] I got to Oh [ __ ] What do I do, man? How did a bee get in my basement?

[00:07:09]Anyways, um horshit, what's happening? And Zen Logic, what's popping, man? How's the trip? Trip was bumping, but it's over now. Time to get back to work.

[00:07:28]I'm worried about this bee in my basement, man.

[00:07:32]I think it stopped. Getting the raid spray now. He can't kill bees, can you?

[00:07:37]I guess he could.

[00:07:40]Trying to stay consistent with my elite code. Um, what's it been like for you?

[00:07:45]Have you been skipping days? Has it been a struggle?

[00:07:50]Have you been at least doing uh the daily problem every day?

[00:07:56]I'm not super consistent with le code, man.

[00:08:01]I am not very active, I guess.

[00:08:08]I go through phases where I don't do anything. I think that's quite normal.

[00:08:15]But I'm not like preparing for interviews or anything.

[00:08:21]It's been hard, but I've been doing the dailies. Yeah, I think doing the dailies is like the bare minimum. I don't think you're going to get much better by just doing the dailies, but at least you won't get any worse, you know.

[00:08:34]Um, is it time to do a virtual contest? Topics and weak on our DP. Yeah, DP.

[00:08:47]I promise, man. I was scared of DP problems for at least a year and a half, maybe more.

[00:08:56]Um, but now I think DP is like I wouldn't say my favorite topic, but some DP patterns I enjoy trying to figure out how to solve them, but it took me a while to get used to it, man.

[00:09:18]Took me a really long time to get onto DP problems. matrix array manipulation and math. Yeah, math is always tough for me because I'm not very strong with my um certain maths in particular. I think combinotaurics and statistics and all that stuff.

[00:09:42]Um matrix problems depends on what they are. If they're like a matrix graph, I'm all right. Hey sir Lord, good. It sounds like there's a lot of topics that you got to work on, man. I'd say instead of worrying about the daily too much, I think the streak is maybe important mentally to keep.

[00:10:04]I don't think I care about my streak anymore.

[00:10:08]But if you want the best bang for your buck, um, focus on these topics that you just listed out here, man. The topics that you're weak on. Maybe not so much DP because I think, well, I don't know.

[00:10:21]five years ago. Um, people say DP is like not really asked too much in an interview, but I think in today's world DP is probably asked.

[00:10:34]Uh, Fluffy, what's happening, man?

[00:10:37]How you doing?

[00:10:40]Gonna join an MLM.

[00:10:43]Hey, you can make some money if you get a lot of people under you. Which language is this? So I usually do C++.

[00:10:54]I guess you can make a lot of money if you are good at recruiting.

[00:11:01]Anyways, um let's see which virtual I got to do.

[00:11:08]508.

[00:11:13]Man, I hear the be buzzing.

[00:11:17]Um, I guess 507.

[00:11:25]507. Here we go.

[00:11:30]Am I ready for it, man? I'm not sure.

[00:11:44]Panama mention 507. That's your country code. Dang, I didn't know that.

[00:11:50]Very nice.

[00:11:53]Is it a random number or is it every contest is 507?

[00:12:00]Let's see.

[00:12:02]509.

[00:12:04]50 510.

[00:12:07]So, I guess it's not the same every time. Which one we're doing? 507.

[00:12:14]Oh, if you come the number of the contest, you get the dang notebook.

[00:12:22]All right, I'm ready to begin this virtual contest here. Let me link it if anybody wants to do it alongside me.

[00:12:40]Here we go.

[00:12:43]Maximum Manhattan distance after all moves. You're given a string moves consisting of the characters up, down, left, right, and underscore.

[00:12:53]Starting from the origin, each character represents one move on a 2D plane. Up, down, left, right, underscore can be independently replaced with any one of up, down, left, or right. return the maximum Manhattan distance from the origin that can be achieved after all the moves have been performed.

[00:13:15]H I think um I think I should add up all the up all the north south direction and left right. So, I'll keep those coordinates as horizontal or something H and width. Or should I use R C? I don't know.

[00:13:48]I don't know what to use here, man.

[00:13:52]Uh, I guess I'll use R and C.

[00:13:59]So, I'll iterate through all the characters and I'll count how many blanks I got.

[00:14:14]Um, I I don't really know what I'm doing yet, but I think counting where the position is and then deciding whether to fill them left or right or whatever.

[00:14:25]So, all right. If this is up, down.

[00:14:37]This a bad way to do it. Left, right, underscore.

[00:14:50]All right. So, if it's up, I'm going to decrement our row.

[00:14:55]Uh if it's down increment left decrement column right increment column and if it's underscore increment my blanks.

[00:15:14]So I guess I should just calculate the Manhattan distance and add the blanks.

[00:15:23]So it just be because since we can put the blanks anywhere, we can easily just move one distance away for every blank from the center from wherever we are.

[00:15:42]Oh, at least that's what I'm hoping.

[00:15:47]ABC three. Uh oh. How am I get three, man?

[00:15:58]Left and down, man. That should be 1 + 1 + two.

[00:16:07]How am I going to say three left?

[00:16:25]Let's see what's happening. Man, I should be able to spot the bug with my eyeballs, but I'm uh down.

[00:16:36]How the heck?

[00:16:38]L.

[00:16:42]Oh, I put R. No, R is good.

[00:16:47]L. So L is good.

[00:16:50]Down did not do anything. Man, isn't that crazy?

[00:17:01]It might be crazy.

[00:17:04]Am I tripping right now?

[00:17:19]Right.

[00:17:22]Some man, I can't I can't see what I'm doing wrong.

[00:17:35]Maybe because I'm blind. All right, let me look one more time. So L.

[00:17:42]Wait, which one is wrong? Um, my left and rights are wrong.

[00:17:49]So if it's an L, decrement the column.

[00:17:54]But that didn't even happen, right?

[00:18:02]This contest is going real bad. Brent aretta, what's happening?

[00:18:10]What am I doing wrong? Brent, cuz something ain't right.

[00:18:27]It's crazy talk.

[00:18:36]How is C?

[00:18:40]Oh, because I have Jesus Christ, man.

[00:18:49]It's because I have C uh double declared there, man. So, I'm going call this big C.

[00:19:03]What terrible code?

[00:19:08]How embarrassing, man.

[00:19:11]All right, I'm gonna send that.

[00:19:15]Oh, Jesus.

[00:19:19]Um, all right. Q2, valid subarrays with matching sum digits.

[00:19:27]You're given an integer array nums and an integer digit x. A subarray is considered valid if the sum of its elements satisfies both of the following conditions. The first digit of the sum is equal to x. The last digit of the sum is equal to x.

[00:19:46]return the number of valid subarrays.

[00:19:58]This one is interesting.

[00:20:04]1,500.

[00:20:08]So, am I just checking every single subarray?

[00:20:13]Um, can I do an N squ there?

[00:20:21]Should I try?

[00:20:25]I brute force or am I tripping?

[00:20:33]How do you do this? I + one.

[00:20:41]No. How do you do every single That's every single pair is like every single subarray.

[00:20:52]And then I I just add the subarray.

[00:21:03]And then how do you tell if it starts with that number?

[00:21:20]H.

[00:21:27]Let me think about that.

[00:21:30]I could like put it to string, but I don't know if that's the move I want to do right now.

[00:21:41]Um, and X is one through nine.

[00:21:52]So I'm trying to figure out if it's faster to do like if some mod 10 equ= x and can do that seems a little bit sus.

[00:22:20]But I'mma try it.

[00:22:26]Zero. Maybe it doesn't like this thing.

[00:22:31]Um, some mod 10 is the rightmost digit.

[00:22:42]And then only if that's true then I'll check the string.

[00:22:54]Oh, I know why. Because now it's a character. So it should be either I can do this or Yeah, I'll do it that way.

[00:23:11]four zero. Should I send that man? Is it going to be fast enough?

[00:23:19]Is converting it to a string faster than just dividing out until the last number?

[00:23:29]We'll find out right now.

[00:23:32]Oh, it's fast enough, man.

[00:23:36]It's too fast. zero milliseconds fast.

[00:23:41]All right, next. Um, shortest path with at most k consecutive identical characters.

[00:23:51]You're given an integer n representing the number of nodes in a directed weighted graph numbered from 0 to n minus one. This is represented by a 2D integer array edges where edges I equal U VW represents a directed edge from node U to node V with weight w. You're also given a string labels of length N where labels I is a character assigned to node I and an integer K.

[00:24:23]return the minimum total edge weight of a path from node zero to n minus one such that the concatenation of the labels of the nodes along the path contains at most k consecutive identical characters. If no valid path exists, return negative one.

[00:24:48]Is this a dystras problem or is it something else?

[00:24:54]This modified dystras. Not sure yet. So, we know it's single source, shortest path, weighted, but you can't go three labels in a row. I don't know.

[00:25:19]I don't know how to check that. Maybe the dyra also need a label.

[00:25:27]Let's see.

[00:25:30]It's a lot of edges, man.

[00:25:34]How many nodes is that? It's like 50,000 nodes.

[00:25:45]I guess we don't really we don't need the whole label path. We only need the last two characters in the label path.

[00:25:55]So that can Yeah, I think I think if we just store the last two nodes label in our dextras and then we just ran regular dystra, we can do this problem.

[00:26:07]But I don't know how to do dextras. I've forgotten.

[00:26:14]Uh, let me try.

[00:26:18]So, I know I'm going to need usually I need a pair int, but I know I'm going to need something else.

[00:26:31]And I'd like to use a tpple or tupole, however you say it. But I always hate looking up the syntax for things. So I'm just going to use a pair ints pair string int pipsy. Yeah.

[00:27:00]Pair int pair string int. Yeah. I'm going to use a pipsy.

[00:27:10]Wait, can I do that though?

[00:27:17]I'm going to try. I'm going to try.

[00:27:23]Um, what do I need to do? I need to make an adjacency list.

[00:27:39]I also need a distances and I need a priority queue.

[00:27:58]Can I use parts Q uh with greater like that?

[00:28:10]We'll find out.

[00:28:12]And we start from zero.

[00:28:15]So I'll just set my distance at zero to zero. And then in my prior to Q, I will push a pair with the weight starting at zero.

[00:28:29]and uh empty string as the label and zero as our node.

[00:28:44]Negative IQ viewer, welcome to the party. I am back.

[00:28:51]I'm back.

[00:28:53]I'm back for hopefully the rest of the year.

[00:28:59]I have a wedding to go to in two months in September and no other obligations.

[00:29:09]Is their holiday good? Yeah, I think it was a great time off.

[00:29:15]Um, but now I'm ready to grind. Grind for real.

[00:29:22]I don't think I've started to grind yet, man, but I think it's about to happen.

[00:29:28]What country did you visit? I went to Taiwan, uh, Korea, Japan, and Jamaica.

[00:29:48]All right.

[00:29:50]No way. Yeah, way. For sure.

[00:29:55]Um, it's a lot of places. Yeah, I'm going to Korea and Japan soon. Dang, that's bumping. Was it good for sure? It was good, man. I don't think you can go wrong with that many nice places.

[00:30:14]When are you going, negative IQ viewer?

[00:30:19]And have you been before?

[00:30:23]All right, let's see. I want to say this is my weight and this is my other info.

[00:30:39]And then I guess we can do like um current label and node like that. Yeah.

[00:30:57]So I don't know what I'm trying to do, man.

[00:31:02]I got to make my adjacency list. I forgot to do that. First time. Dang.

[00:31:06]It's going to be a good time. I have a friend that is going to live there for some time. So when he will be in place there with his home and stuff, I will join for some time. Your friend is going where? Korea or Japan or both places.

[00:31:25]All right, let me make this agency list.

[00:31:27]It is a directed weighted graph.

[00:31:31]So that means we just push back.

[00:31:40]Where do we push him back?

[00:31:49]Uh we're pushing back the the weights and then we're also pushing back.

[00:32:04]Ah, this doesn't need any label, does it?

[00:32:08]I guess this could be H. This is getting a little weird.

[00:32:19]I guess I guess this one the adjacency list I don't I already have the labels elsewhere so it could just be um the weights and the node elite whale Hello. How you doing, my friend? What's popping? Korea because flights are cheaper and we'll visit Japan after. Anyway, that's good. Now, I might ask you some questions about Korea if I have any. Hey, I'm no Korean expert.

[00:32:57]I'm more familiar with Japan than I am with Korea. Anyways, negative IQ viewer.

[00:33:03]Take care, man. Thank you for popping stopping by popping in.

[00:33:09]Um, what was I trying to do?

[00:33:16]I'm in my JC list.

[00:33:20]I have my priority queue and just do that lazy thing. Now I'll iterate through all the children in the adjacency list. So what's in there?

[00:33:56]The child weight and the child node.

[00:34:06]And we take the new weight. So we have to do a few checks here.

[00:34:13]Tomkins, what's happening?

[00:34:16]Any reason for the leak code grind or just for funsies?

[00:34:20]I'd say I wouldn't call it a grind.

[00:34:25]Um, yeah, maybe just to keep my brain sharp. It's kind of just for mental stimulation, I guess.

[00:34:37]H um but I started out doing le code five, six years ago, seven years ago because I wanted a job but now I don't really want a job but I still do leak code because it's kind of become a little bit fun you know it's like a very high skill video game in some ways or just like a puzzle game to Blue cactus AI. What's popping? Sharp as attack. I don't know about that.

[00:35:14]All right, let's see. New weights would be equal to the child weights plus our current weights. And if our new weight is less than our distance to that child node, then we should try this.

[00:35:38]But not only that, we also have to check like the label.

[00:35:46]Um, how do I do this?

[00:36:05]I couldn't. All right, it's going to look ugly.

[00:36:12]If the label I'm going just call this I don't want to type current label every time. So I'm going just name it L.

[00:36:35]uh labels child then continue. This means it's like three things in a row.

[00:37:00]So maybe I should like say continue here.

[00:37:06]But should I always continue if it's equal? Maybe I should just use greater.

[00:37:15]And I wonder if I have to remember the labels because I don't know yet. I'll just solve it and see what problems I run into. But I guess there could be a case where the distance to a certain node is the same, but the labels getting up to there, the last two labels are slightly different.

[00:37:36]And maybe choosing one path over the other is better, you know? So, I don't know if like we should just skip it if it's equal.

[00:37:47]Anyways, um let me see what else we have to do. I have to push this into the priority queue.

[00:37:56]But the priority Q is up here with the weight first. The weight always goes first because that's what it gets sorted on.

[00:38:05]And then uh the new label would be I put L2 and I will put new label.

[00:38:27]Um, so the first thing becomes that and that becomes the current label.

[00:38:55]So, I guess we'll put the node here, the child node.

[00:39:04]All right.

[00:39:08]Uh, Stephen Lf, what's happening? How's it going? Yeah, it's going good, man. Good to see you.

[00:39:17]Um, all right. I think that's all I'm going to do, man. Oh, wait. I have to update my distances.

[00:39:36]Maybe that's it now. So, Oh, it compiles but it's not right.

[00:39:59]So I got example two is two, example three is -1.

[00:40:11]That ain't right, man.

[00:40:15]How is that zero?

[00:40:27]So there's um 0 to one and then one to two.

[00:40:34]So this goes zero.

[00:40:37]Oh, you know what?

[00:40:40]You know what's wrong? This is wrong.

[00:40:43]This should be This should be This should be like that, I guess, because it doesn't start blank. It starts from the first node.

[00:41:07]So maybe that's where something's going wrong. Let's see.

[00:41:12]No, example one's still incorrect.

[00:41:15]Example two is okay. Example three is incorrect.

[00:41:25]Oh, I guess this part uh could be a little bit sus.

[00:41:35]H.

[00:41:46]It's getting sloppy.

[00:41:49]Super hacky band-aid code.

[00:41:55]So, if it's two, I should do that.

[00:42:02]If it's one, which I assume it's one right here.

[00:42:14]I'll do that.

[00:42:17]All right. Negative one.

[00:42:19]All right. The first test case is not great, but I fixed the third one, so it returns negative one.

[00:42:29]All right. Let's see why this one is failing. So I'm saying the answer is two, but it's not.

[00:42:39]So we got zero to one. All right, let I haven't done much asy art for graph drawing, but let me try real quick if I can do it.

[00:42:49]So I got zero to one.

[00:42:55]I guess this one isn't too crazy. and uh one to two and then dang how am I going to draw zero to two I guess like this or something.

[00:43:14]Oops.

[00:43:19]That's good enough, right?

[00:43:22]Uh so this weight is one, this weight is one and this weight is three.

[00:43:40]So they're saying wait how zero to two.

[00:43:53]Okay. Oh, because it's not Dang. My bad.

[00:43:58]I kept thinking um last three like three consecutive, but it's not three consecutive. It's K consecutive. Man, I just did all that junk. Oh, but K's only 50.

[00:44:19]I have to modify a lot of things. I think most things are okay, but I don't know why I forgot K was a variable here.

[00:44:30]Why? I kept thinking three in a row. I don't know where that came from. But if I had to modify this, the first thing I'm thinking is maybe I should not use a string as my label.

[00:44:45]I hear the B again.

[00:44:50]Maybe I should use a deck or how can I do this right?

[00:45:09]No, I think a string is good. I think a string is actually real good because then I'll do this. This is some bootleg stuff.

[00:45:23]So, I'm going say this this part is bootleg, too.

[00:45:32]So all right, let me just put things down here. Check if last K are the same.

[00:45:44]So this is my check. What I'm going to do, I'm going to take the label length.

[00:45:55]I'm take the size of the label and then I guess I'll keep k minus one in there.

[00:46:09]So if the label size is k minus one and whichever l0 is equal to the child label then this is k in a row and we should continue and then when we're printing the new label I'm going to say um if if the child label is equal to our old labels first character Then then the new label is just the old label with one more otherwise I guess I could just put this here and then eliminate that and maybe it should be all right now.

[00:47:56]Oh, still not right.

[00:48:01]Wait, why is this test case not? Oh, wait.

[00:48:08]Because K is one.

[00:48:10]That means we can't go from one, you know, that thing to that thing.

[00:48:17]So uh right here label size is not k minus one.

[00:48:33]Oh k equ= 1 is like an edge case for me with my code. Let me think because here I'm checking the label size is one.

[00:48:47]Maybe I say if it's greater than k minus one then we got problems.

[00:48:57]All right, there we go. Three 2 andgative one. Uh, should I send it?

[00:49:09]I guess why not, man?

[00:49:17]Time to exceeded.

[00:49:21]Come on, man.

[00:49:45]What does that mean? It's too slow.

[00:49:46]Yeah, that means my solution is too slow. And I think my problem is right here. I'm copying this old label.

[00:49:54]Um, but I'm not sure if I want to copy everything cuz I only need I think this is my problem for sure.

[00:50:23]copying the labels like that. I only need the last K. It seems like this test case was designed to fail me, but K is one here. So, this label should just be a single character like almost every time.

[00:50:44]I'm going do something funky.

[00:50:52]It's gonna be real funky, man.

[00:50:55]No. No. I'm not going to do it. It's too funky.

[00:51:02]I'm going just be like um What am I trying to do?

[00:51:39]What am I trying to do, man?

[00:51:48]So, that's the end.

[00:51:51]So, I'm trying to go from This is a little strange for sure, but I think it will work.

[00:52:22]Use this test case only.

[00:52:27]Come on, man.

[00:52:31]Something ain't right right here.

[00:52:48]What could it be?

[00:53:04]I think I'm real close. Zero.

[00:53:09]Oh, yeah. Yeah. Yeah.

[00:53:13]I see what's happening.

[00:53:30]very sloppy, but maybe it will work.

[00:53:34]Maybe it won't. Time exceeded still. All right, what else could be the problem?

[00:53:41]All right, my next guess is maybe I can do that.

[00:53:48]That's creating a copy every time.

[00:53:52]Um, still not great.

[00:54:10]What else can I do to speed things up here?

[00:54:14]Oh, wait. Let me look at the inputs. The sizes What else can I do, man?

[00:54:49]Maybe can I use a deck instead of a string so I can like pop fronts or something?

[00:54:59]Holy whale. You think I should do greater than or equal?

[00:55:04]You know, I purposely did that, but Oh [ __ ] Maybe I shouldn't have. Dang. How the hell? I was thinking because of the labels thing, you could reach a node and match the distance, but your last labels are different, you know, um, and it could lead to a different answer, like an answer that is correct versus I don't know if you know what I'm saying. So that's why I didn't do gray and or equal here.

[00:55:38]Um, okay. There. Okay. There will be a bug.

[00:55:45]All right.

[00:55:48]So maybe this is Wait, which did I get this test case?

[00:56:00]All right. So maybe I have to do something besides maybe I have maybe it has to be like distance and the label at that distance needs to match otherwise you try it again.

[00:56:19]But why would this one fail?

[00:56:22]because I don't know 0 to one one to two so it should not be able to reach I swear this isn't this the thing yes so when I do that for some reason uh get channel. Thank you very much for that. Hydrate. Cheers.

[00:57:04]Yeah, Elite Whale is always there, man.

[00:57:07]Oh, we need him the most.

[00:57:13]Um, wait, how did that change things though?

[00:57:28]Maybe something else broke.

[00:57:35]Oh jeez.

[00:57:38]Let me erase this one.

[00:57:54]So something else broke when I introduced whatever label size thing.

[00:58:02]How did I mess it up?

[00:58:05]So I start with the A label.

[00:58:15]And then so the label size coming in for the first time should be one and label size greater than greater than equal to Maybe.

[00:58:38]All right. So, Leet Whale says there's still going to be a bug. I'm going to submit knowing that it's going to break anyways according to Leit Whale, but also we sused out um we sused out the problem before.

[00:59:02]You're right with your intuition about needing more for the distance state.

[00:59:06]Right now, your state is but you can have a more efficient state. Yeah.

[00:59:14]Wait, my states is well, my distances state is kind of just a number, but I think I hear what you're saying.

[00:59:26]Um, I'm going to have the distances be I don't know, man.

[00:59:51]I'm not sure.

[00:59:57]You're just using node for distance, right? Your state is really iron node.

[01:00:01]All right. Yeah, I see what you're saying then. Like, yeah, my distances thing is just int, but I actually keep the label inside here. And I just check the label like right here.

[01:00:21]But there's a way that we can check probably both or more efficient.

[01:00:31]I don't know how to combine those two into one state.

[01:00:38]If I was a caveman, what would I do?

[01:00:46]I would I'm trying to think.

[01:00:52]What would a savage like me do?

[01:01:01]I was going to see if I can do like some type of unordered map and make some bootleg key with like the distance and stuff, but maybe that's not great. Um, so I know the label is important and the distance is also important.

[01:01:35]But instead of a label, maybe we can have Like we don't actually care what the label is.

[01:01:48]We only care about how many consecutive characters there are.

[01:01:58]Yes, we don't we don't actually care what the label is. So maybe maybe something like just keeping counts but I don't know how to implement that.

[01:02:16]So instead of having the starting label like that of like starting streak or whatever or whatever.

[01:02:36]I mean I could just put one there too but I just want to make it explicit that it is the starting streak.

[01:02:58]So if my streak is greater than equal to K, I should continue.

[01:03:21]And then wait, maybe I can be like if streak plus what do I call them? Labels.

[01:03:58]It's too many parentheses.

[01:04:00]But if that is greater than equal to k continue and then this can be an int.

[01:04:17]And then what do I do here? We don't need a new label.

[01:04:28]Um, we can just say we can just check if they're equal.

[01:04:49]Man, that bee is in here, man. Buzzing around. I hear it.

[01:05:03]All right. This is a little bit better and representing uh our state and what we care about, but I don't know if it's going to fix whatever problems we had here.

[01:05:23]Start label.

[01:05:26]I don't need that.

[01:05:30]Ammo NB, what's happening? That's you.

[01:05:35]Hey, buzzing around real loud.

[01:05:40]Um, I don't know what's what here.

[01:05:47]Test case. Everything's wrong one.

[01:05:54]Wait. Re reset test cases, man. How do you reset them?

[01:06:04]Jeez.

[01:06:10]I don't know. I don't know how to Let me refresh. Maybe that will help.

[01:06:20]Oh, reset test cases.

[01:06:25]Uhoh.

[01:06:27]Negative one. Huh?

[01:06:33]Oh, I see. I see. So, this check the streak is already one.

[01:06:42]Um, so maybe it should be greater than K. All right. 3 2 1. All right. I'm going to submit this, but I feel it's still not fully right.

[01:07:06]All right. Time exceeded.

[01:07:16]Oh, let me put that part back in.

[01:07:19]I'm going to have so many wrong submissions on this thing, man.

[01:07:24]All right, one more submit. Even though I'm pretty sure it's not right.

[01:07:30]All right, here we go. This is the test case that we've wanted to find. the test case that probably says something about uh this part being wrong where if the distances maybe I need to check that the distances and um the streak or something you know you know what I'm saying so I have distances there.

[01:08:11]But how do I do that other part?

[01:08:22]Maybe I have to do like a streaks.

[01:08:35]Uh yes it's like when you do DP you have to include all the necessary parts of the state child by itself is not enough to represent the current state hold on elite whale let me think about what you're saying include all the necessary parts of the state you mean like when you're looking in the fresh the child by itself and I I'm using the child.

[01:09:07]Yeah. So my distance is kind of like my cache.

[01:09:12]So you're saying I'm going to need to put like of one more dimension here which is and then it should be of child sizes and then of K sizes um or something whichever um which one's the the bigger ones on the outside and the smaller ones in the middle or the bigger ones in the middle. I forget which way, man. I think the bigger ones in the middle.

[01:09:55]If I think about it, I can get it. But I'll just start with this. So, we're going to check streak.

[01:10:12]I'm going just do a plus one for good luck. Maybe a plus two.

[01:10:35]Should I move that down here when we capture the new streak instead?

[01:10:58]I'm not sure, but I think we could try.

[01:11:07]And then a streak of one maybe. I don't know what's put there. 0 0 1 0. Who knows?

[01:11:38]How do I know if we reach?

[01:11:58]Who knows?

[01:12:06]What do we return here, man?

[01:12:12]The minimum of those distances.

[01:12:37]Dang. How do you do this, man?

[01:12:44]Because should I have swapped them?

[01:12:53]Um, I guess it goes to K + 2.

[01:13:09]This is some real bootleg thing.

[01:13:29]This is real bootleg, man.

[01:13:36]Let's see.

[01:13:43]I don't think I got the right answer.

[01:13:47]The first time you pop node N minus one from your priority Q will contain the shortest distance to reach node N minus one. So, you can return as soon as you hit node N minus one.

[01:13:59]Oh, that that makes a lot of sense.

[01:14:03]But my answer is still wrong. Oh, let me see.

[01:14:22]This problem is too hard. Leap whale.

[01:14:26]See, I'm getting the wrong answer. still expected 527.

[01:14:33]Let's make sure.

[01:14:36]Oh, maybe it's a different test case.

[01:14:38]Oh, look at that. It was a different test case.

[01:14:44]All right. Thank you very much for all that help, Elite Whale.

[01:14:48]Yeah, I think I saw everything there. I just wasn't sure how to implement correctly, especially with the distances thing like that. I I don't think I've ever done a distances like a 2D distances like this, at least not in recent times.

[01:15:10]Interesting problem.

[01:15:13]Decent dystras, a little bit challenging, man. Can you guys hear that B?

[01:15:23]Sounds like it's right there.

[01:15:30]Just got to make sure to include the whole state. Like a DP problem. Yeah, I guess Dextras is kind of like DP, huh?

[01:15:43]Would you say so? Yeah.

[01:15:50]Um, should I try Q4?

[01:15:55]I ain't too sure about Q4.

[01:16:00]Maximum total value. You're given two integer arrays, value and decay, and an integer M. Value I represents the initial value at index I. Decay I represents how much the value decreases after each selection of index I.

[01:16:18]You may select any index multiple times.

[01:16:21]The total number of selections across all indices must not exceed M. If you select index I for the tth time where T is one indexed, the value gained is value I minus decay times T minus one.

[01:16:41]Return the maximum total value you can obtain. Since may be large return mod.

[01:16:52]What are they asking man?

[01:16:57]So we have these values initial value at index i and decay.

[01:17:04]Okay. How much time it decreases.

[01:17:09]And we can um we can take m selections.

[01:17:14]What is the maximum?

[01:17:22]Interesting problem.

[01:17:25]10^ the 5th n is equal to 10 to the 5th.

[01:17:46]Um.

[01:17:53]All right.

[01:17:55]So, obviously selecting the largest number first is probably a good choice.

[01:18:06]But how do you this a greedy problem or something else?

[01:18:19]Um, all right. Say this one then it goes out to four.

[01:18:25]It's like a priority queue problem.

[01:18:32]It's a hard problem. So I don't want to like think it's technique is too simple like you put all these into part Q along with their indices.

[01:18:46]You just pop M times and then you subtract and put them back in.

[01:18:54]Oh, M is a billion. Yes. Yes.

[01:18:59]So, we can't just party a billion times because that ain't bumping.

[01:19:06]So, what the heck are we supposed to do?

[01:19:22]And M being a billion is crazy cuz every solution, all right, the most obvious solution to me is the priority Q thing where you put all these numbers in with their index and as you pop them, you add them to their total sum and as you put them back in, you subtract the decay.

[01:19:42]But with M being so large, that's not feasible.

[01:19:48]So what else can we do?

[01:19:51]Um maybe we can do something with the decay.

[01:20:09]Like we can calculate how much each thing maybe some like division or something.

[01:20:27]Can see that we can take like this many times.

[01:20:45]All right, Lee Whale, can I solve this problem or is this a technique that I don't know?

[01:20:56]It feels like it's some like some techniques I know I could maybe use, but I don't know which ones.

[01:21:11]Is this like a math problem?

[01:21:32]I didn't solve this one. Dang.

[01:21:35]If you can't solve it, man, I for sure can't solve it.

[01:21:41]Um, sounds a little bit tough with M being so large.

[01:21:53]Maybe some crazy technique that I don't know yet.

[01:21:58]All right, maybe that's where I stop for this contest at least.

[01:22:09]Maybe you can clap its cheeks. I'm not trying to clap any problems cheeks, man.

[01:22:19]Let's see what it's saying, man.

[01:22:26]Man, look at all those hints.

[01:22:31]I'm read I'm read the topics.

[01:22:36]Greedy math.

[01:22:44]Yeah, greedy problems tough. Math problems even harder. They also say binary search. I was trying to think how the hell can you binary search that?

[01:22:55]Especially with it this mod thing.

[01:22:59]Like definitely not binary searching on the answer, but maybe binary searching on something else.

[01:23:16]Unsure.

[01:23:22]Unsure. But I think I will move on to another. Let me do one more virtual today.

[01:23:30]See how we did on that other one. Not too great.

[01:23:37]Dang. 507. Man, look at these ranks.

[01:23:42]It's not binary searching on answer.

[01:23:44]It's binary searching on something else.

[01:23:46]Yeah, seems a little advanced for me, man. If I was still taking contest, I think I'd do really bad. I don't even think I'd be a knight anymore, man, if I had to take contest in 2026.

[01:24:08]Um, all right. So, 185, maybe by weekly 185.

[01:24:22]Yeah, let's do that one.

[01:24:34]Um, all right. Here we go.

[01:24:39]Am I ready?

[01:24:42]I'm not ready.

[01:24:59]All right.

[01:25:02]Is that a new Fitbit? That is the Fitbit Air.

[01:25:08]Let's bump it. I like it. I've only had it for a few days, but it's like I don't even feel it, man.

[01:25:17]I can sleep with it on. It doesn't feel like anything.

[01:25:21]It's real easy. I've had smart watches before. I can't sleep with those things on. I've had regular watches. I also can't sleep with those on. But this little Fitbit Air is nice. Also had the Aurora ring, but I gave that up. The ring was too big and I didn't feel like paying that subscription.

[01:25:46]Sorry, I guess got this Fitbit error.

[01:25:52]All right, here we go. Create grid with exactly one path.

[01:26:00]What you're given two integers m and n representing the number of rows and columns of a grid.

[01:26:08]Construct any n byn grid consisting of only the characters dot and hashtag where this is a free cell that's an obstacle.

[01:26:20]Uh return a grid where there's only one path.

[01:26:26]All right.

[01:26:29]Um, how do you do this size M?

[01:26:40]How do you how do you create a string in place? Is it like that?

[01:26:51]Let me see.

[01:27:04]All right. It's okay. So, I'm going to just fill everything up with hashtags and then I'm going to just go from there and I'm going say row column is a free space and then I'm going go from what am I doing That's one single path.

[01:28:10]I guess I can't look at the answers, but I they say any path.

[01:28:25]We'll see.

[01:28:27]Too easy. Next question.

[01:28:31]Minimum lights to illuminate a road.

[01:28:35]You're given an integer array lights of length n representing positions zero through N minus one on a road. For each position I, if lights I equal V, where V is greater than zero, there is a working bulb at position I that illuminates every position from the max of zero and I minus V to the min of N minus one I + V.

[01:29:01]So basically plus or minus V in those directions.

[01:29:08]If lights I equals Z, there is no working bulb. Position is visible if it is illuminated by at least one working bulb. You may install additional bulbs at any positions. Each additional bulb installed at position J illuminates positions from J minus one to J + one. Return the number of additional bulbs required to make every position of the road visible.

[01:29:41]Okay. Um, how am I going to do this problem?

[01:30:01]I hear what the problem is saying.

[01:30:06]So, I need to like illuminate everything. I wonder if I can do like a multisource BFS.

[01:30:17]Um, multissource where I add all of the light bulbs in there and then I just BFS like they all illuminate the cells that they go up to.

[01:30:30]I think I can do that and then go through and then put down cells. But I got a P. Hold on. Uh, Ren Zeneskirts, what's happening? When you're not in a contest, do you look up a solution if you get stuck for over an hour or do you keep trying until you get it? I usually don't get stuck for over an hour, man, because I'll give up around 45 minutes or so. Um, but I usually don't really care to look up that much. But I'm also not really preparing for an interview.

[01:31:03]I'm just doing this for fun. But I'll be right back. I gotta pee.

[01:33:11]All right, here we go.

[01:33:17]Um, what was I trying to do with this problem?

[01:33:23]Multisaurus BFS.

[01:33:29]Um, I don't think that's going to work.

[01:33:59]Man, is this problem card.

[01:34:28]So, there's no lights.

[01:34:34]All right. So this one, how do I know?

[01:34:57]Am I overthinking this? Let me look at the constraints. So there is 100,000 Um, and the lights number can be up to 100,000.

[01:35:42]I guess I could visit each light mark all the lights I get covered.

[01:36:04]But there are some cases where that might not work. Like if they gave us a 100,000 all the lights, you know, that would be TLE.

[01:36:13]So what else can we do here?

[01:36:24]Maybe some type of stack or maybe like a go from left uh from right like left pass right pass.

[01:36:49]So if you pass left, left to right.

[01:36:54]I don't know, man. This problem is not that straightforward for me.

[01:37:02]So if it did a left pass, we'll see that this is lit up. All right, I'll use 0 0 and I'll put the the X's are lit up.

[01:37:16]And this is left to right. And if I did a right to left.

[01:37:33]Yeah.

[01:37:45]All right, I'm going to try that. So, so um how did I'm going try to implement that.

[01:38:10]So, that's the size I'm going to say left to right or I'm going just call it LR and RL.

[01:38:33]So if I iterated from left to right and then I find that uh it's greater than zero.

[01:39:04]How do I do this?

[01:39:40]I don't know what I'm doing yet.

[01:39:47]something like this.

[01:39:54]So that should give me something good. And then I'll do it again from right to left.

[01:40:08]Just copy this and reset cur and then now when I'm is iterating through I need to count the streaks.

[01:40:41]All right, here we go.

[01:40:44]So, I'm racing through right now.

[01:40:52]And I'm going to say if if left to right is one or right to left is illuminated, then we're good.

[01:41:10]But if it's not illuminated, increment my streak.

[01:41:21]Every time it's good, I'm going to have to add.

[01:41:32]How do I know? So divided by three.

[01:41:38]One / three.

[01:41:42]How do I say that? So if it's one streak in a row, it's one light. If it's two streaks in a row, it's still three streaks, it's still one light.

[01:41:54]So if is is it just streak divided by three?

[01:42:02]seal.

[01:42:09]Is it the ceiling?

[01:42:14]I think so.

[01:42:28]Let me see if that works. There might be a some problems with my code.

[01:42:49]Zero. That ain't right. And one. So the one is good.

[01:42:55]How come this? Oh, because I need one more post-processing.

[01:43:04]So, two and one. All right, I think I'm going to submit this.

[01:43:13]Easy. Not bad. Not bad.

[01:43:17]What's next? Q3 finish time of tasks one. You're given an integer and representing the number of tasks in a project numbered from 0 to n minus one.

[01:43:30]These tasks are connected as a tree rooted at task zero. This is represented by a 2D integer array. Edges of length n minus one where edges i equal uv indicates that task u is the parent of task v.

[01:43:50]Uh you're also given an array base time of length n where baset time i represents the time to complete task i.

[01:43:59]The finish time of each task is calculated as follows. Leaf task the finish time is base time I.

[01:44:07]non-leaf task. The earliest be wait let earliest be the minimum finish time among its children and latest be the maximum finish time among its children.

[01:44:20]Let own duration be latest minus earliest plus baset time I. The finish time of task I is latest plus own duration.

[01:44:31]Return the finish time of the root task zero.

[01:44:37]I don't know what they're asking, man.

[01:44:45]Earliest be finish time among his children.

[01:44:59]Latest earliest.

[01:45:09]All right. Um, what the heck?

[01:45:14]So, let's see. Example one. N is three.

[01:45:18]There are the edges. Base time 953.

[01:45:24]And they ask the finish time for the root task zero.

[01:45:31]Uh co-coder what's happening subs. Oh what's not happening co-coder deleted message anyways.

[01:45:52]Um what was I what was I doing?

[01:45:58]or the root task.

[01:46:04]Elite way, what's up? I think a lot of YouTube people think I'm not live on YouTube because I still have to update my stream to show my YouTube messages on the chat.

[01:46:17]But I just been really lazy, man. I haven't done that yet. So, anytime somebody types a YouTube message and it doesn't show up on my screen, like how the Twitch messages show up on the screen, they think it's a recording and then like they usually leave.

[01:46:33]So, one of these days I'll change that, man.

[01:46:41]Um, I don't understand what this problem is asking yet, though. All right. Task two is a leaf. So its finish time is just its base time. Task one has one child. So earliest and latest is three.

[01:47:07]Latest minus that's zero. Plus base time is five.

[01:47:14]So the finish time of task one is eight.

[01:47:29]All right.

[01:47:34]One child.

[01:47:39]Oh, I see.

[01:47:41]all of his direct children.

[01:47:45]I see what they're saying.

[01:47:50]So, we need a DFS. That's what they're trying to tell me, man.

[01:47:56]Or something.

[01:48:00]I will try Let's make an adjacency list.

[01:48:16]So I'm searching through all of my edges and it is directed. So zero has the children E1, but it's also weighted, right?

[01:48:41]But the times are given here. So we're good.

[01:48:45]Right. So that's my adjacency list.

[01:48:48]What's next? Next is I guess I want to DFS from the root node um to somewhere. I don't know how to do it yet.

[01:49:04]So that just return like that.

[01:49:10]All right, let's figure out how this works. So we do some stuff.

[01:49:16]Do we need a scene?

[01:49:20]I don't think so.

[01:49:23]We do some things. Um, visit all his children.

[01:49:37]Um, earliest and latest.

[01:49:58]But first, maybe we can be like If there's nothing in the adjacency list, then this is a leaf node.

[01:50:09]And we can say if it's a leaf node, we should just return the base time.

[01:50:20]So if it's the earliest, latest whatever they say own duration is latest minus earliest plus the base time.

[01:50:48]So, it's telling me to do that.

[01:50:52]And then here, just visit every child.

[01:50:57]Um, All right. Is that it? I don't know.

[01:51:22]Seems a little sus.

[01:51:36]And I guess maybe these should be long longs.

[01:51:45]This should probably be a long long.

[01:51:48]This should be a long long.

[01:51:51]All right, let's see.

[01:51:56]17 12 18. What do we have? 17 12 18. Should I send it?

[01:52:08]I'mma send it.

[01:52:13]It's too easy.

[01:52:19]Why is that so easy?

[01:52:23]Um, Le code making Q3 easier than Q2.

[01:52:27]Seems so.

[01:52:29]All right. Q4. Count good integers in a range. You are given three integers L, R, and K. A number is considered good if the absolute difference between every pair of adjacent digits is at most k.

[01:52:46]Return the number of good integers in the range L through R inclusive.

[01:52:52]The absolute difference between values X and Y is defined as that.

[01:53:00]Come on. Some digit DP stuff.

[01:53:06]I don't know if I got an inmate to do a digit DP right now, man.

[01:53:13]But let's see.

[01:53:16]Um, absolute difference between every pair of adjacent digits is at most K.

[01:53:45]Can I do a digit DP? It must be digit DP because look at that 10 to the 15th.

[01:53:59]But I don't even remember how to do a digit DP right now and how to modify it to fit for this problem.

[01:54:09]Difference between values.

[01:54:17]So basically I just need the previous digit and the current digit. I can do it. I can do it. Let me try.

[01:54:28]Um, I will try.

[01:54:36]I actually don't know if I can do it, but we'll see. First thing, um, I'm not even sure what I need here in my parameters, but I do know I need the digits. So, I'll make a function And I guess we should return vector of ints.

[01:55:20]So this is the digit mod 10 / 10.

[01:55:31]I guess we should reverse.

[01:55:39]I think so.

[01:55:45]I will reverse.

[01:55:49]All right. So, that's going to give us some digits and we're going to be like, uh, Steven Sagall, what's popping?

[01:56:15]All right, those are my digits.

[01:56:19]I guess we can say what what can we say?

[01:56:28]Maybe I should actually pass in my digits.

[01:56:41]Um, I know there's a boolean that we need fourdigit DP.

[01:56:53]We're going to need some other things, man.

[01:57:02]All right. So, if we go out of bounds, we're good. We're just going to return one maybe, right?

[01:57:23]Do I care about trailing zeros or leading zeros?

[01:57:31]I'm not too sure, but I know I have to go through all the numbers and like if it's um too much at most K. So if it's greater than K, we don't even need to try.

[01:58:11]But there's a whole lot of things I'm missing here. I have to try and remember things.

[01:58:17]How are you doing, Steven Sagall?

[01:58:23]Are you still at the company you used to work for?

[01:58:30]I don't even know. I know uh lots of things are happening over there, you know.

[01:58:43]Anyways, I guess do we need a limit or something?

[01:59:07]Aren't they recording your desktop at that company right now? What you talking about, man?

[01:59:13]Hey, Fluffy, you're still around? You hear the bee, man? The bee has been buzzing the whole stream, man. I'm Oh, [ __ ] It's in my lights, man.

[01:59:36]You guys want to see this bee?

[01:59:41]Oh, it's right in front of me right now, man. I don't know what to do. Should I end stream? This bee's gonna get me.

[01:59:50]Show me your B. I'mma show you right now.

[01:59:57]Wait.

[02:00:08]Oh, I I just took a I just took a few pictures of that bee.

[02:00:15]Man, how did it even get in here?

[02:00:26]Killing this can't end. Get my wife to kill it. No, we don't kill bees around here, man.

[02:00:38]All right. Oh [ __ ] I don't know what to do, man.

[02:00:49]All right. I posted the picture.

[02:00:54]Jesus is my Hold up, man.

[02:01:06]We got problems.

[02:01:10]We got big problems here.

[02:01:16]Jesus Christ. Here's a bee.

[02:01:32]Look at that bee, man.

[02:01:35]It's lost.

[02:01:38]What is it doing?

[02:01:48]I'm a little bit scared. It's real difficult to concentrate on a dang leak code problem trying to do digit DP when there's this bee buzzing around like he looks angry or something.

[02:02:07]Um, my window's open because of because of AC. What does that mean? Your window is open because of AC.

[02:02:20]Yo, it's getting closer, man. It's getting crazier.

[02:02:28]He's too close, man.

[02:02:37]Oh [ __ ] Yeah, he's in some funky movements, right? I think he's trying to sting my lights.

[02:02:52]Did he just sting my light, man?

[02:02:57]Did he just kill himself?

[02:03:10]Uh [ __ ] I don't know what to do.

[02:03:19]Hold on. Have you been stung by a bee before? I've never been stung by a bee in my whole life because I don't mess with them.

[02:03:27]I don't shoe them away. I don't try and hit them or swat them. I just stay out of the way, man.

[02:03:36]Like it can kill. Yeah, I seen that one movie when I was a kid where the little boy got stung by all the bees and he died.

[02:03:45]Oh [ __ ] All right, guys. I might have to end stream, man.

[02:04:15]I don't know where he went.

[02:04:22]All right.

[02:04:26]Oh, Jesus Christ.

[02:04:30]Hey, did you guys see it? It flew like right on my chair. I don't know if you guys saw it, man.

[02:04:37]My girl. Yeah, I think that was the movie where the kid got stung by the bees.

[02:04:43]All right.

[02:04:46]Oh [ __ ] It's in my top light, man.

[02:04:56]Can't believe you're scared of a bee.

[02:04:58]What do you mean you can't believe that, man?

[02:05:06]I'm not trying to get stung.

[02:05:12]It sounds angry, man.

[02:05:18]I don't want to kill it, but I might have to because what am I going to do? It's got separated from its colony.

[02:05:32]is probably going to die in here anyways.

[02:05:38]Might as well just kill his ass.

[02:05:45]But then he's going to sting me if I try and attack it, man.

[02:05:50]All right. It's been chill so far.

[02:05:54]Uh let me just focus on the DP.

[02:05:59]Looks like a work. Oh [ __ ] man.

[02:06:23]Hey, Q. Ultimus, thank you very much.

[02:06:27]Thank you very much for the sub, man.

[02:06:29]There's a bee and he's he's buzzing around right now and I'm a little bit scared.

[02:06:38]Oh Jesus.

[02:06:46]He's getting more and more crazy as time goes on, man.

[02:06:56]Um, I don't know if I can focus on digit DP.

[02:07:00]And there's this crazy man. I got to take a video of this thing. He's doing some crazy moves, man.

[02:07:08]I think he's freaking out.

[02:07:18]What the hell are you doing, Mr. B?

[02:07:25]It's not a good video. He stopped.

[02:07:32]My heart rate is Let me look at my heart rate right now. It feels like it's bumping.

[02:07:40]Oh [ __ ] My heart rate is over 100 beats per minute right now.

[02:07:49]Usually it's not. So this bee is crazy.

[02:07:56]All right.

[02:07:58]Wait. Um, let me do this before I forget. Man, Q Ultimus, thank you very much.

[02:08:10]Also, what's up, Q?

[02:08:13]Hey, I think the bee killed himself.

[02:08:19]He's not moving anymore, man.

[02:08:23]Like completely stopped moving.

[02:08:29]I think he exhausted himself, man.

[02:08:35]Think I should try and capture his ass and put him outside.

[02:08:44]You think he's playing dead?

[02:08:48]Wait, man. I wish I had a webcam on his ass.

[02:09:01]All right, look.

[02:09:09]Look at him.

[02:09:12]I send you.

[02:09:22]Look at him. He's not even moving. He's curled up in a ball. I think he exhausted himself.

[02:09:38]All right, I got my eye on him, man.

[02:09:42]Does he have a big back end on him?

[02:09:46]Sussy. Wait, maybe. Yeah, he was looking like he was moving a little strange.

[02:09:51]Maybe he stung my light.

[02:09:56]But all right, if he's playing dead, he's real good because I've never seen a bee play possum like this before.

[02:10:15]Anyways, we got to focus on this problem, man.

[02:10:24]the bee might be dead now. He just killed himself.

[02:10:29]Um, all right.

[02:10:32]It's a bug farm. What you talking about?

[02:10:34]That thing is huge. I could hear him buzzing from across the whole room. Man, I I didn't scare him to death, man. He scared me to death.

[02:10:46]I am not from Texas. That bee looks harmless right now. It looks harmless, man.

[02:10:56]Oh, man.

[02:11:00]All right.

[02:11:03]You have to leave the chunk for a bit so it despawns. What are you talking about?

[02:11:11]I can't I've never seen an animal die so quickly.

[02:11:18]Is it dead?

[02:11:23]It's still not move. If it hasn't moved this long, I think it just exhausted itself to death cuz it was starting to freak out, man.

[02:11:32]It was starting to like do all types of crazy moves. It was flying, going upside down, twisting its body.

[02:11:43]Maybe it was poisoned.

[02:11:45]Who poisoned it? Not me. I don't even know how it got in here, man. How the hell did a bee find its way into my basement.

[02:11:56]Anyways, um did it try to sting the light? Do you think it ruptured his inside like on the net geo documentaries? Hey, that's what I'm trying to wonder. But I I can try and get a closer picture.

[02:12:24]My blood. Hey, bees don't drink blood, man. That's mosquitoes.

[02:12:30]What you talking about? My blood is crazy. The bee didn't even sting me.

[02:12:39]Um, yeah. This This bee This bee is not moving. I think we're safe.

[02:12:54]I can't even focus on it.

[02:13:02]All right. Um, I'm going just leave it. Pretend it's it's dead.

[02:13:29]What a stream though. We saw a new life introduced to us. saying it was taken within minutes. Yeah, I'm surprised it died like that, man.

[02:13:37]Pick it up and give it a proper burial.

[02:13:39]I'm not touching that thing.

[02:13:42]Uh, Tanvir Singh, what's happening from YouTube? How are you doing? I'm sorry, I'm a little bit distracted right now, man. And a bee just came and invaded my space. And we think he's dead, but he might be trying to trick me.

[02:14:01]The be is being courteous. Have they heard you were in the middle of a contest? Yeah, I should have waited.

[02:14:09]Anyways, [ __ ] Don't you have hawk wasps or scorpions in Jamaica?

[02:14:22]I haven't seen a scorpion. I don't know what a hawk wasp is.

[02:14:29]But yeah, there is there's flying things in Jamaica for sure.

[02:14:34]I'm scared of them just like how I'm scared of bees though. I don't mess with things like that, man.

[02:14:41]Honka, Frosty Bagel 2, where am I from?

[02:14:43]I'm from Jamaica, but right now I live in Canada.

[02:14:51]Anyways, that be messed us up, man.

[02:15:06]Uh, tarantula wasp, man.

[02:15:13]Jesus Christ. I've never seen one of those things in my life, man.

[02:15:19]I've never seen any dinosaur mosquito like this. That's crazy.

[02:15:27]No, he's smart enough to play dead.

[02:15:29]Wait, he could be an old man that wandered off and he exhausted. Yeah, I think he just exhausted himself to death. I've never seen anything quite like it. That's the first time I I saw something die right before my eyes from exhaustion.

[02:15:47]What if that bee was actually you reincarnated?

[02:15:51]How is that going to be me? I'm not dead yet, man.

[02:15:59]All right, we got to get this one problem done.

[02:16:05]Um, how do you how do you do digit DP? So, it's like let me try and remind myself. So if I had some number 452, I call the first thing.

[02:16:38]The limit would be four.

[02:16:48]um is equal would be false and then scene on zero.

[02:17:19]Maybe we also need that.

[02:17:23]I would take a bee over a wasp, hornet, or mosquito any day. I would take nothing over any insects in my basement any day. Man, I'm not too scared of a bee because I know like they don't really attack you unless you bother them.

[02:17:47]I wasn't worried in the beginning, but as that bee got more crazy as time went on, I started to get scared cuz he was starting to fly all types of craziness.

[02:17:57]I thought he was going nuts and it's best if I stayed away.

[02:18:07]You have to pick one. I'll pick I'll pick a single mosquito because I can kill those things easily and if they bite me, it doesn't really hurt.

[02:18:21]You looking uh to get into quant trading aftershock. What's happening? I'm not looking to get into quants.

[02:18:31]Malaria, man. I' You know how many mosquitoes bit me? I haven't gotten malaria yet. Think I'll take my chances with a single mosquito.

[02:18:45]How much runway you have left? Probably I have more runway left than I had when I started my journey or started using my runway.

[02:19:01]which is crazy. I don't even know how that's possible, man.

[02:19:07]Yeah. How? I don't know, man. I don't know how that happened, but I guess everything just goes up.

[02:19:18]How's the non vacation queue? It was good. I think it was necessary to disconnect for a little bit.

[02:19:27]H.

[02:19:29]Um, anyways, but regardless of how much runway I got, I'm still capping it at around two years. So, right now, I'd say we're about 6 months in that 2year time period.

[02:19:49]So, I got like a year and a half before I got to make another decision, whether to keep going or to get a job.

[02:19:59]But I'd say it really just began, man.

[02:20:02]Because the last six months or so, I don't think I really starting anything. I think it's more of just like an adjustment period for me and a little time to cool off. But now I feel well rested and I'm ready to actually start uh the real battle, you know.

[02:20:26]trying to do content creation full-time.

[02:20:28]No, I don't think I want to be a content creator like that, man. While I do enjoy streaming and stuff, I can't imagine if like all my money is tied to trying to go viral all the time or something, man.

[02:20:44]I'm not I'm not uh I don't want to be an entertainer, I think. But I do enjoy streaming and talking to people sometimes in Roses.

[02:20:58]What's happening? Assuming job, where would it be?

[02:21:03]I'm not sure. Wherever is bumping at the time, wherever would hire me? Maybe if my old or took me back, perhaps I would go back there or at least start there. Um, but that's in like two years time. So, a lot could change in two years, especially how the last year went. You know, that bee was your best content and it died, man. You think that B was my best content?

[02:21:34]My content must suck.

[02:21:38]That's why I'm not a content creator.

[02:21:46]All right. Um, I'm a little sad that the bee died right in front of my eyes.

[02:21:58]Like, I just There's only been a handful of times where I seen something just die right before my eyes, man.

[02:22:07]And I'm feeling pretty sad right now.

[02:22:14]Like that mouse. Yeah, like that that mouse. One time I was walking to Costco in New York with my wife and we saw a mouse on the side of the road or a rat. I think it was a mouse and then somebody on a scooter just hit the mouse and I just watched it die right in front of me, man.

[02:22:38]Um, how are you feeling sound about the bean now? I gave you an ex existential crisis two minutes ago. What do you mean?

[02:22:50]Um, I don't know. I guess we'll see.

[02:22:56]So, potentially you would move again.

[02:22:58]No, I don't want to move again. All right. If I had to go find a job, it would be somewhere where I live now. But I know like my old org had people in Toronto, people in Zurich, people in New York, people in Seattle, and people in Sunnyvale. So I think if I were to go back to a job and they could get me in that Toronto office, maybe I'll just go there.

[02:23:28]Be will go down in history as one of the legendary characters of this stream along with pixel pusher and Cornelius.

[02:23:35]Man, maybe life is so ephemeral. We're We are that bee. We are that bee, man. That's why I'm a little sad.

[02:23:48]Wait, how are you feeling sad? I see.

[02:23:51]Um, man, it's still a bee, man. I could see that the bee was in distress. like I heard the bee, I didn't trouble it. I tried to just go about my business, but then he started to come closer and closer to me and I've never really seen a bee like be attracted to the lights, but he started to go towards my lights, man. Maybe he's like flying to the gates. the the light, you know, the white light is coming and he just wanted to go there and then he just stopped. He just stopped moving. I thought he was playing dead, trying to trick me or something. And then and that's it. He just stopped moving and now I'm looking at the dead body.

[02:24:42]What if it was asking asking me for help?

[02:24:48]Um, yeah, it was kind of crazy how the chat started buzzing when that B came along. Yeah, I guess people rather watch me get scared of a bee then watch me do lead codes.

[02:25:04]Probably just got stuck indoors and was looking for a way out. Yeah, K little Pixel, what's happening? This was an odd time to hop in here. No, this was a great time, man.

[02:25:16]Uh, a bee derailed the stream kind of.

[02:25:23]Hey, what if the bee just got up right now?

[02:25:26]Oh my god, it's moving.

[02:25:33]I swear I saw its body like pulsing.

[02:25:43]I saw his body pulsing, man. He's alive.

[02:25:52]Oh, Jesus.

[02:25:54]But I think he's done for. Maybe he's just like having a seizure or something, man.

[02:26:07]All right, I'm going to assume he's pretty much dead.

[02:26:18]Are we really talking about a real bee?

[02:26:20]Yeah, man. A bee is right here.

[02:26:26]Put a cup on him. He's on my light, man.

[02:26:28]I got to touch him to like get him off.

[02:26:33]Um, anyways, when I jump out of the chair, it gives you anxiety. No, I'm just No, I'm not jumping out. I'm just trying to get a closer look.

[02:26:59]All right, I'm about to solve this dang digit DP problem.

[02:27:09]Um, bees can literally become zombies. I'm not lying. Hey, how is this a zombie bee?

[02:27:23]You know that fungus? Hey, I think I watched that documentary, man.

[02:27:28]I think I watch I watched that documentary with some mushroom funguses and they turn the ants into zombies or something like that.

[02:27:37]What was it called?

[02:27:40]Fantastic fungi or fungi or something.

[02:27:44]Digit DP. One of the few DPS I never solve. AQ. Digit DP is a lot scarier than it sounds.

[02:27:52]It's not. Yeah, it's not that bad. Q. I promise. I'm scared of a lot of advanced algorithms, but I don't think Digit DP is labeled like kind of advanced.

[02:28:07]Wait, it's a it's not as scary as it sounds, man.

[02:28:13]Oh, that V got me tripping, man.

[02:28:16]Anyways, anyways, um Oh, we have to go to the limit here.

[02:28:32]But then how do we know what the limit is the new limit?

[02:28:56]Um, wait.

[02:29:05]Cordicps fungus is what you guys are talking about from last. No, this this ain't no movie cue. I'm talking about real life.

[02:29:15]Real life, not some fictional fungus.

[02:29:23]Anyways, how do you do this? So if x is not equal to limit Oh, there's two. No.

[02:30:03]So is equal. How do you know if it's equal or not?

[02:30:12]Imagine that fungus can control us one day. Hey, one day it might happen. Sue such chut what's happening I can't say the name properly such cut I can't read how you doing um wait the idea for the game came from real life the real life name was ofio cordicps unilateral What?

[02:30:52]I didn't know that. In England, our bee population is so bad and declining that we have important bees from the Netherlands and Norway.

[02:31:02]Important or imported bees.

[02:31:05]I mean, England is a good place for Simon. No, I don't think so. I mean, maybe I wouldn't mind. Um, such cut. What do I do?

[02:31:16]I'm pretty much a bum. I don't do anything. I don't have a job. I just stream sometimes and I do leak codes every now and then.

[02:31:27]Bees are dying. Can't believe Simon I didn't kill that bee, man.

[02:31:32]I didn't kill that bee.

[02:31:35]All right, let me try and solve this problem because I got to go soon.

[02:31:42]So, the new is equal. So, if we were equal, how do I know, man, what the new equal is and scene non zero.

[02:32:49]All right, let's try that.

[02:32:52]DP uh digits I + 1 the new limits new equal and new zero and then what are we trying to do? We're trying to add those all up and then we have to mod something or no.

[02:33:25]Do we add them up back here?

[02:33:40]And then so our digits um limits I guess false.

[02:34:05]No, no, no, man. Hold on. Hold on.

[02:34:07]What's What is my limit here?

[02:34:16]Is it equal initially?

[02:34:21]Should I say false?

[02:34:24]True.

[02:34:27]See non zero. False.

[02:34:34]All right, let me try that. Man, I didn't even catch it, but let me see if it's correct first.

[02:34:59]No, you want us to believe it. Randomly died. Yeah, we have saltfish and aki and no bees. Yeah.

[02:35:09]How Hey, do you know how much aki costs in England?

[02:35:15]I'm guessing you have like tin aki or something. In Canada, it's like $14 a can. Man, it's crazy.

[02:35:30]All right. What is it saying?

[02:35:37]Oh, and this one.

[02:35:56]One 14. No, this ain't good.

[02:36:17]All right, I got to try and figure out what's going on here.

[02:36:25]I got 19 minutes before the time is up for this contest.

[02:36:35]So, I get three H And then nine.

[02:36:56]Interesting.

[02:37:04]How much grams in the can? I don't know, man. I don't know that off the top of my head.

[02:37:14]Two.

[02:37:17]That's crazy.

[02:37:19]That's crazy that L digits at nine is two.

[02:37:26]Um, so I think there's a bug for sure. I mean, obviously there's a bug because it's not right.

[02:37:45]Then we put some either seyous or hey this should be a lot more. So it's coming in got the digits.

[02:38:03]It's adding up the rats but it only gets here one time.

[02:38:11]So initially, oh wait, this is I and my limit. So my limit in this case should been whatever. Let me do some see outs here.

[02:38:37]I say it's about4 to5 for a can, which is about 9 Canadian bucks. Interesting.

[02:38:43]That's decent price, I guess. I guess there is probably a lot more Jamaicans in London or I don't know. I don't know if there's more in London than in Toronto, man.

[02:38:57]It's tough. There's a lot of Jamaicans in Toronto.

[02:39:03]All right. There's a lot of Jamaicans in New York, South Florida, Toronto, and London. Those are like the three hot four hot spots, but I don't know which one has the most.

[02:39:15]If I had to guess, maybe New York also have lots of bayons.

[02:39:28]Bahamians, that's what you call them.

[02:39:31]Trinies also. Yeah.

[02:39:33]You're in I am in Toronto. I see black deep. What's happening? I'm near Toronto.

[02:39:39]Millionaire. Who's a millionaire?

[02:39:41]Wait.

[02:39:44]Who's Who's a millionaire?

[02:39:47]Oh, Barbados. I see. I don't know any Barbians.

[02:39:56]All right. So, this digit is nine.

[02:40:02]Um.

[02:40:07]Oh, I see.

[02:40:17]I see where I'm messing up.

[02:40:24]Is that Jamaican meme? You don't know it? No. Millionaire.

[02:40:30]Jamaican meme. You guys looking at Jamaican memes?

[02:40:34]Are you a Stanley girl? What does that mean?

[02:40:42]Anyways, I think I see the um this is wrong right here. digits I.

[02:40:54]So it should be if I greater than zero and digits I -1 is greater than K continue.

[02:41:08]All right, let me see how that looks.

[02:41:17]We'll see.

[02:41:25]Negative 10.

[02:41:47]No, I think I messed this part up.

[02:42:02]Um, I I see what I'm doing, man. And I'm seeing like bits of it, but it's a little distracting le to try and like keep up with chat and focus on the bugs in my code. But I see what's happening because the nonzeros something with the nonzeros here. This part is wrong for sure because that singledigit one is getting all of them and then the twodigit one is not getting any of like single digits.

[02:42:39]So it should be like maybe instead of doing the I minus one thing I should there's a different way I can do it but I don't know.

[02:42:58]Lewell says I need to lock in.

[02:43:02]Wait Birmingham and Manchester also have massive Jamaican populations. I would say half the British national football team is of Jamaican heritage. Yeah.

[02:43:13]Now, I know there's a whole lot of Jamaicans out there, but I think they're mostly older Jamaicans from way back when uh Jamaica was a British colony. I don't think the new wave of Jamaicans aren't going to England like that, man. They're going to like New York or South Florida or Canada.

[02:43:41]All right.

[02:43:51]So, so if we've seen a nonzero maybe, but we still have the cash things, but we're still just trying to find a correct answer.

[02:44:30]Um, do you have one tip for succeeding in Java algorithms at university?

[02:44:40]I'd say the one tip I have is study hard. Uh, I don't think there's any secret code or anything.

[02:44:47]Uh it's just about how much time you put in and how hard you study. So that's that's my one tip. Create a schedule and stick to your schedule for studying, you know.

[02:45:04]Wait.

[02:45:06]Uh wait, no, they're the ones from the Wind Rush generation. You're you're right. Very old wind rush generation. Never heard that term.

[02:45:19]I was happy to see how fast I was solving this leak code contest, but then the bee ruined it. Yeah, I like the way you think and explain things so calmly.

[02:45:28]When something doesn't work for me, I get frustrated right away and then nothing works anymore.

[02:45:34]Um, sometimes I get frustrated too. Like right now it's hard to focus because that B kind of threw me off.

[02:45:48]But I think that's also built up over time.

[02:45:53]It's not like I was born and I was like how you see me. It took a lot of practice and stuff to get here, you know? So don't get frustrated um if you don't have that level of resilience yet. So you do more, you get more resilient, I think.

[02:46:13]Question marks.

[02:46:15]What happened?

[02:46:21]All right. So I think I have to figure out my leading zeros thing and then um the previous digit. So, it's getting a little strange because if we seen a nonzero.

[02:46:47]So, if this is false, that stuff shouldn't trigger.

[02:46:56]But this part So I'm trying to do it without introducing another number here and I think we can.

[02:47:22]So, I just need to make sure that we seen a nonzero.

[02:47:28]And I guess if we've seen a nonzero, then we can remove that.

[02:47:36]But that's like the same thing.

[02:47:46]And then this one besides 10 It would have 11 wait 10 11 and 12.

[02:48:03]So this should be nine. I should get the first things would be nine and I should be getting 10 11 and 12.

[02:48:12]Uh I got to do some see outs here. I got to see my L digits. No, my R digits should be returning 9 10 11 12 numbers, but we're only getting 10.

[02:48:35]Why is that?

[02:48:45]We're only getting 10.

[02:48:50]So if R was 10, how do we get 12 if R is 10? Isn't that a little crazy?

[02:49:06]Wait, any reason for not introducing another ARG? Uh, not really. I just feel maybe we can do it without the new AR guys going to introduce is previous digit. Previous yeah previous digit but I feel like we don't need that.

[02:49:28]Oh wait, we do need that man. Why am I tripping?

[02:49:34]Because it's not what's in digits i minus one. That's going to be fixed.

[02:49:42]That's never going to change. So, we do need um Yeah, I don't know. I'm too distracted to think straight. That's the problem. Le oil 1947 sounds way too late for the first Jamaicans. Wait. Named after Wait, the Wind Rush. Named after the boats Empire Wind Rush, which brought over the first Jamaicans to the UK in 1947.

[02:50:13]Sounds Yeah, it sounds a bit late, but maybe it was like a boat with only Jamaicans or something because I know some Jamaicans. I guess Jamaica wasn't a country yet, but it was an island and I think they helped in World War II, but it must be like some other arrangement there.

[02:50:38]Anyways, all right, five five minutes left. So, let me introduce this new thing. I'm going say previous digit.

[02:50:46]I'll just call it pre and instead of doing uh this thing it should be x minus pre and pre becomes x and then um initially I guess we can it doesn't really matter I'll put negative big number.

[02:51:25]Looking at Wikipedia, looks like a postwar wave of migration.

[02:51:29]Interesting.

[02:51:32]I don't really know that type of history, but maybe I should. You know, I like Jamaican history.

[02:51:48]All right. Two. That's not right. 66.

[02:51:51]All right. We still got some more problems, man.

[02:51:56]Oh, wait. Let me take that out.

[02:52:02]Two and zero. All right. We definitely got more problems.

[02:52:10]Um, all right. How can I debug, man?

[02:52:19]How can we debug this scene?

[02:52:26]All right. So, this should return 12.

[02:52:30]But turning 78, that's how you know something ain't right, man.

[02:52:54]Look at that wrong test case. Oh, wait.

[02:52:57]Oh, yeah.

[02:52:59]You're right.

[02:53:03]Um H.

[02:53:09]So, it's returning 12.

[02:53:17]Um maybe it's a problem with K being greater than one.

[02:53:31]at most.

[02:53:33]Okay.

[02:53:50]Where am I messing up?

[02:54:00]C non zero is false.

[02:54:05]The limit. Oh, wait.

[02:54:11]Go to the limits. Is that right?

[02:54:16]Go to whatever they tell us to to go to.

[02:54:32]Suss pass limit along like this. Right.

[02:54:36]Right. I was just thinking that because usually you calculate the limit whether or not we're equal.

[02:54:45]It's been a while, man. Wait.

[02:55:05]Um, let me think.

[02:55:10]Do you have a degree? I have a degree in mechanical engineering, but I got really long time ago back in 2010 or so.

[02:55:32]16 years ago. Dang.

[02:55:35]I was never a mechanical engineer.

[02:55:42]So you're saying we don't need to pass that limit.

[02:55:47]We just need to pass is equal.

[02:55:51]Time's up. But I'm still gonna try, you know, a little bit cuz I got to go soon.

[02:56:05]Um 13. Is that right?

[02:56:22]I've heard too many Emmy stories for me to believe that. What are you talking about, man?

[02:56:28]Oh, look. This is right now. It's crazy.

[02:56:30]Now I need to cash it.

[02:56:33]That I was never an I was I never had a mechanical engineering job, man. No one wanted to hire me because I don't know why.

[02:56:45]Um, man, one, two, three, four dimensions.

[02:56:54]Two, three, four.

[02:56:59]And it's a long, long.

[02:57:05]All right. First one.

[02:57:12]Oh man.

[02:57:20]Um, can we use the same cache?

[02:57:39]So, one is equal boolean.

[02:57:45]Wait, how do you do this? Vector vector I always forget the easy way to make crazy dimensions.

[02:57:57]Vector, vector, vector, long, long, one, two, three.

[02:58:02]It's going to be two and then vector vector long long and it's going to be two vector long long.

[02:58:23]And this one is going to be 10.

[02:58:50]Set that to negative one.

[02:59:00]Um, YouTube, what's popping? Good morning, Abilash. How you doing? You from Canada?

[02:59:08]How's life there? I live in Canada.

[02:59:11]It's pretty cool. It's kind of bad right now because there's a lot of wildfires going on. So, the air is real funky.

[02:59:24]Um, accounts office officer, what's happening? I'm from India. Welcome. Welcome.

[02:59:35]Brent said CS is the new me.

[02:59:38]Yeah, maybe internship though or Yeah, I've had an internship and I had a senior project and stuff.

[02:59:48]Um, I interned with Loheed Martin for my some alter not like weapons or anything.

[02:59:58]I did the Loheed Martin alternative energy division that got shut down and I never got a return offer because the whole department got shut down they say.

[03:00:13]Um, hold on. I got to go soon. So, I'm just trying to finish this.

[03:00:27]Come on, man.

[03:00:30]What are they talking about here?

[03:00:40]R digits.

[03:00:44]What's Oh, maybe maybe when the previous goes in.

[03:01:01]H I want to leave zero as previous. Then show chat the photos I sent you.

[03:01:12]What photos?

[03:01:16]Yo, what the heck kind of photos are you sending me, man?

[03:01:26]What the [ __ ] Where did he get his picture from, man?

[03:01:47]Yo, I didn't kill no dang bee.

[03:01:55]Hey, is that the same bee?

[03:01:59]He moved, man. He doesn't He's not in that position anymore.

[03:02:04]AI slop.

[03:02:09]Anyways, I'm so sorry for that bee.

[03:02:18]Ew.

[03:02:20]All right. Something ain't right.

[03:02:23]Something ain't right.

[03:02:27]All right. I got an idea. This previous needs to be something else.

[03:02:34]And then I'm going to pad it um to 11.

[03:02:39]And then I'm going to give a plus one to the previous in there to see if that helps.

[03:02:52]But they don't like that either, man.

[03:03:00]Oh, I'm going to need separate caches.

[03:03:02]Dang. And that's what I was trying to wonder, too. Do I can I use the same cash?

[03:03:07]All right.

[03:03:11]All right. We We got this. We just got to make big ass cash. Um, hey, can I can I just say auto cash?

[03:03:35]because I'm not trying to type all that again. But I I kind of see how the cache might mess things up, especially if L and R are different sizes.

[03:03:45]I can see that for sure. So now I'll pass in the RC cache and the Lcash.

[03:04:03]Come on, man. We're trying to go. It's past my stream time right now.

[03:04:15]All right. What are they really talking about this time, man?

[03:04:21]Because is it because I plus one it and we don't need that plus one anymore.

[03:04:34]All right.

[03:04:38]It's too easy. All right. That was my first digit DP in a few months.

[03:04:43]I think I got it. I just was a little bit rusty in the implementation. Um but this brings back everything to me.

[03:04:52]AK AK this contest kind of you have killed this in a real contest.

[03:05:01]Hey Ricky Wong, what's popping? The bee died for this. Yeah, the bee did die, man.

[03:05:08]Um, dang, that bee though. I think it's dead for real. It hasn't moved again.

[03:05:22]Anyways, that be is gone.

[03:05:28]Um, all right, guys. I guess that's it.

[03:05:32]That's all.

[03:05:35]I'll see you guys another time.

[03:05:40]Well, when am I streaming? I guess I don't know if I'm going to stream besides Monday, Wednesdays, and Saturdays. I haven't even updated my website. Maybe I'll work on um maybe tomorrow I'll do some work on midnights.com, like get my stream schedule back up, answer these dang questions that I don't have anywhere to answer, things like that.

[03:06:08]You had a really good pace for this contest until the beat interrupted.

[03:06:12]Yeah, I think I was doing all right, man. But let's see what my uh let's see what I would have gotten with only three solves. Dang, with only three solved, 3600. That's decent.

[03:06:32]And then I I think I would have gotten that Q4 in a real contest. Um, but basically everybody wait what it say 3 I came 32.

[03:06:53]Hold on. I got to look at that one more time.

[03:06:59]36. So I'm almost the fastest person who never solved all four in this contest.

[03:07:06]because 3,200 is like the fastest Q3 solver.

[03:07:18]So that's decent.

[03:07:20]Very good for me actually.

[03:07:25]All right, man. Thank you very much. Oh, Muhammad, what's happening? Hi, I'm graphic designer and start learning AI inspire from your programming skills.

[03:07:36]Thank you very much, man. Um, I've been programming for a long time.

[03:07:43]I've been programming since 2013.

[03:07:48]No, wait.

[03:07:50]Yeah, 20 13 years I've been programming, man.

[03:07:54]But every year I haven't given it good effort. Some years a whole lot of effort, some other years almost nothing.

[03:08:05]I was 13 and 13. Dang.

[03:08:09]Um, yeah. RIP B.

[03:08:13]I was I don't know how it was in 2013, like 25 or something.

[03:08:21]This year, two months on vacation. Hey, that's normal, man.

[03:08:25]That's I used to I used to live my life on vacation every year and that was a those two months it was a good reminder of what my life used to be like before I became a corporate drone.

[03:08:50]Uh you got to show your family Japan.

[03:08:53]Yeah, it was nice. Yeah. Rest in peace, Mr. B.

[03:09:00]Um, Abilash, have a good night. All right, let me say my goodbyes to everybody, man.

[03:09:08]And then, um, how do I how do I do it again?

[03:09:15]All right, everybody. I'm out of here.

[03:09:18]Today's my first full threeh hour stream since I've been back and it's nice.

[03:09:26]Anyways, I gotta go, but I'll be back on Saturday to do more le code and sprites off rager. What's happening?

[03:09:38]Or spirits off. Sorry, I can't read.

[03:09:42]See you later, man. Le Whale Addios Q Ultimus take care. Uh, Abilash from YouTube, Muhammad from YouTube, accounts officer Mr. M from YouTube. Have a good night. Thank you very much for tuning in. Icy Black Deep, Steven Sagall. Halo halo. We them boys. Adios. The engineer Ricky Wong. Have a good night. Thank you very much for watching me le code and uh run away from the bee.

[03:10:16]Um, Shalev, have a good night everybody who's lurking. See you next time. Wait, I didn't even initiate a raid, man.

[03:10:26]I don't even know what I'm doing.

[03:10:29]I'm supposed to initiate the raid and then say my goodbyes.

[03:10:35]Jesus. Now I got to Who Who am I going to raid real quick?

[03:10:42]Now it's awkward. Yeah.

[03:10:45]Um, I don't know who to raid, man. You guys want to watch somebody play video games?

[03:10:54]I don't see any leak coders on right now.

[03:11:01]Raid Ninja. All right, I gotta go. I gotta go. Um, I might not even raid, man.

[03:11:09]Next time I'll raid somebody. Today, I don't feel like raiding nobody, man. So, I'll see you guys. See you later YouTube and everybody.

#LeetCode #Software Engineering #Programming #C++#Keyboards

Related Videos

Computer Science

TOP 15 Data compression Interview Questions and Answers 2019 Part-2 | Data compression | Wisdom jobs

wisdomjobs

281 views•2019-06-28

Computer Science

CTS 158: 802.11w Management Frame Protection

ClearToSend

4K views•2019-02-04

Computer Science

NDSS 2019 Send Hardest Problems My Way: Probabilistic Path Prioritization for Hybrid Fuzzing

NDSSSymposium

496 views•2019-04-02

Computer Science

How realistic is Cities: Skylines?

CityBeautiful

159K views•2019-02-14

Computer Science

GUIs & TUIs: Choosing a User Interface for Your Python Project | Real Python Podcast

realpython

2K views•2025-04-04

Computer Science

The OSI Model - Explained by Example

hnasr

225K views•2019-05-12

Computer Science

Cloud Computing - Introduction

elithecomputerguy

98K views•2019-10-07

Computer Science

From Traveler's Dilemma to Dynamic Routing | Demystifying Networking

IITBombayJuly

5K views•2019-08-04

Trending

WOW! Judge TURNS THE TABLES on Trump in His OWN $10B LAWSUIT!!!

MeidasTouch

197K views•2026-07-23

Playstation NO DISC/NO BUY Fight Is Over...

DavidJaffeGames

4K views•2026-07-23

Steam and Xbox Just Dropped The Hammer On PlayStation

OhNoItsAlexx

9K views•2026-07-23

Americans Confused in Australia for 17 Minutes Straight

IWrocker

17K views•2026-07-23