Dumbest guy doing leetcode live day 32

Added: 2026-05-07

[00:00:00]From zeroing dreams to a toad in here all fall I pray but I don't stay down I turn my loss into my crown I'm cold guy still in the fight going through the darkest night but I still create I build my future I don't yeah every dev still figuring it out you're not behind you're just building code out.

[00:00:40]Yeah, this for every dev. Still stuck in tutorials.

[00:00:47]Still waiting for that first offer.

[00:00:50]Cold guy in the code base.

[00:00:53]Let's go. I wake up late, laptop on my lap. Another day where I'm stuck in a trap. Le code open. I'm staring at trees, but my brain says, "Bro, just let it be." Functions break when I think too hard. Life feels like a badly written card. Merge conflicts in my real life script. Every dream feels like it might just slip. Apply to jobs. Got we regret to inform. Now the rejection feels like the norm, but I still type code. When the world goes mute, trying to turn the struggle into proof. Yeah, I'm down, but I'm not done. Every failure just makes me run. One more try, I reload the pain.

[00:01:25]WATCH ME TURN IT ALL AGAIN.

[00:01:26]>> I'M COLD GUY. I built from zero. Working dreams to a golden hero. I fall out, but I don't stay down. I turn my loss into my crown. I'm good. Still in the fight.

[00:01:37]Coding through the darkest night. No job yet, but I still create. I build my future. I don't wait.

[00:01:44]Now I'm switching stacks like I switch my mood. Full stack grind. Yeah, I stay in the loop. React front hand back and flow. Trying to build what the companies want to know. D say pain still hits my head. Binary search, but I feel half dead, but I debug life like a debug code. Turning pressure into a stronger mode. Gen tools in my workflow now.

[00:02:03]Making smarter apps. Learning how not to syntax. I think systems, building solutions, breaking limits. They see results. They don't see nights. They don't see struggles only highlights. But every just my way. I'm getting closer every day. I'm a guy. I build from zero.

[00:02:19]Following dreams to a golden hero. All I don't stay down. Want to turn my loss into my crown. I'm cold guys. Still in the fight. Golden and crew. The darkest night. No job yet, but I still create and I build my future. I don't wait.

[00:02:34]Now I see it clearer than before. Every rejection open the door. Not hired yet, but I'm still in motion. Coding my way like an ocean. One day off a letter in my hand. Till then I'm building. I make my stand. From stack overflow to life control. I CODE MY PATH. I OWN MY WRONG.

[00:02:50]>> I'M COLD NIGHT. I BUILT FROM zeroing dreams to a toen her fall I pray. I don't stay down. I turn my loss into my crown. I'm cold guy still in the fight.

[00:03:01]Going through the darkest night. No job yet. But I still create. I build my future. I don't wait.

[00:03:10]Yeah.

[00:03:12]To every dev still figuring it out.

[00:03:16]You're not behind, you're just building.

[00:03:21]Cold guy out.

[00:03:32]Yeah, this for every dev. Still stuck in tutorials.

[00:03:39]Still waiting for that first offer.

[00:03:42]Cold guy in the cold base.

[00:03:45]Let's go. I wake up late, laptop on my lap. Another day where I'm stuck in a trap. Le code open. I'm staring at trees, but my brain says, "Bro, just let it be." Functions break when I think too hard. Life feels like a badly written card. Merge conflicts in my real life script. Every dream feels like it might just slip. Apply to jobs. Got me regret to inform. Now the rejection feels like the norm, but I still type code. When the world goes mute, trying to turn the struggle into proof. Yeah, I'm down, but I'm not done. Every failure just makes me run. One more try, I reload the pain.

[00:04:16]WATCH ME TURN IT ALL AGAIN.

[00:04:18]>> I'M COLD GUY. I build from zero. Working dreams to a golden hero. I fall out, but I don't stay down. I turn my loss into my crown. I'm cold. Still in the fight.

[00:04:28]Cing through the darkest night. Don't die yet, but I still create. I build my future. I don't wait.

[00:04:36]Now I'm switching stacks like I switch my mood. Full stack grind. Yeah, I stay in the loop. React front hand back and flow. Trying to build what the companies want to know. D say pain still hits my head. Binary search, but I feel half dead. But I debug life like a debug code. Turning pressure into a stronger mode. Gen tools in my workflow now.

[00:04:54]Making smart apps learning how not to syntax. I think of systems building solutions. Breaking limits. They see results. They don't see nights. They don't see struggles. Only highlights.

[00:05:04]But every just my way. I'm getting closer every day. I'm calling guy. I build from zero. Following dreams to a golden hero. All I pray, but I don't stay down. I turn my loss into my crown.

[00:05:16]I'm cold, guys. Still in the fight. Cold and through the darkest night. No job yet, but I still create and I build my future. I don't wait.

[00:05:26]Now I see it clearer than before. Every rejection open the door. Not hired yet, but I'm still in motion. Coding my way like an ocean. One day I'll let her in my hand. Till then I'm building. I make my stand from stack overflow to life control. I CODE MY PATH. ON MY ROAD.

[00:05:42]>> I'M COLD GUY. I BUILD FROM ZERO. Dreams to a golden hero. Fall out. But I don't stay down. I turn my loss into my crown.

[00:05:50]I'm cool guy. Still in the fight. Going through the darkest night. No job yet, but I still create. I build my future. I don't wait.

[00:06:02]Yeah.

[00:06:04]To every dev still figuring it out.

[00:06:08]You're not behind.

[00:06:10]You just build guy out.

[00:06:32]Yep.

[00:06:56]What the hell is this?

[00:07:02]Can I just use code guy 01 save? Yes.

[00:07:22]Oh [ __ ] bro.

[00:07:30]You may not change your name. Display name only capitalization of it. Okay, I can't change once you create you can't change the name.

[00:07:48]Let me capitalize.

[00:07:56][ __ ] you.

[00:08:11]Twitch model.

[00:08:33]Oh my Go to the lake. Carbra.

[00:08:58]Wow.

[00:09:01]I am a human. I am a human.

[00:09:09]A5 rotate less.

[00:09:20]Okay. Link list question.

[00:09:25]Given head of link list, rotate the list by right K places.

[00:09:36]What the hell?

[00:09:41]Given link list rotate the array by K places.

[00:09:52]Yo, what's up, man?

[00:09:57]How do we rotate and link CES, man?

[00:10:02]I know how to rotate an array k places.

[00:10:05]Shall I convert the link list to array and uh since output is like normal array and we just convert into array and rotate by k places and return back.

[00:10:21]That is not allowed in the interview, right?

[00:10:31]So let me let me write if you're not able to hear me. I don't know if I'm audible or not. Uh so what I'm saying is um rotate rotate it by K places and return the output.

[00:11:08]Let me share this question to my people on the disord.

[00:11:15]Uh, PD problem of problem. Sorry, problem of Seriously, bro. What the [ __ ] So let me print the head. Can we just get the head instead of head?

[00:11:58]What are we getting after printing the head? Are we getting the value was required? Yeah, we getting the value.

[00:12:03]Now what we can do is like just rotate by K basis in the normal thing. Yeah.

[00:12:12]So let's write the rotate function for this time. Uh since we know how the rotate work it is basically number.

[00:12:22]So we'll have the end and it passing the start of the star of start and of start a show the end of 10.

[00:12:53]So double now we have the rotation rotate function right now. Now you have to only rotate k places. You need three rotation to do that. Uh since we have done this so many times the same question already you have to rotate from uh -1 till we have to rotate we have to rotate from -1.

[00:13:35]So we can see and rotate.

[00:13:44]Now we have to rotate from 8 till 8. length and uh our head won't be okay let me create the head bro I can't do I don't think head will have the length so what you can do is like get the head here I think head should have the head value r and uh we have to rotate everything at once I guess at the end rotate from zero till um uh a r and will be like a rus one to minus one.

[00:14:51]First one will be like um from from 0 to k 0 to k minus one. Okay.

[00:15:00]And next one will be like k till n and last one will be like complete array r.

[00:15:12]Okay, I think it's good now.

[00:15:15]They did not even mention anything like you have to do it in in place or something. So I think using an array is a good way of solving this. I don't know maybe they are asking me to do in two pointers but I'm just doing it in the normal way how we do the array thing. I have to return a r if this is rotated then we rotate is working right. Start end of start and start and end.

[00:15:53]And let me check once.

[00:16:05]Okay, we got some error here. What's the issue here? Okay, it should be error, I guess.

[00:16:13]Are we using the head somewhere?

[00:16:15]Uh, we using only head. I think it should work now. If my rotation function is proper, then it should work. Um, we're getting some issues here.

[00:16:26]A rus one is right one. I guess what is the issue here?

[00:16:36]Okay, let me comment this and uh first check if my head is here.

[00:16:46]Okay.

[00:16:49]So, can I just copy the head itself?

[00:16:56]Hey, can't this operator then I can do this?

[00:16:59]This is pointing the same thing. So, now this should work, right?

[00:17:05]It doesn't matter for me like it is pointing in the normal way or like what saying to me then it should be fine.

[00:17:22]So this was right. You can do split off for this thing. No other way of popping this thing that is not editable.

[00:17:34]Um fine. Can I do this?

[00:17:39]We got a wrong answer right now. What is the issue here? So the rotation did not work. Let's debug.

[00:17:48]My head error consists the head and uh rotation will start from here.

[00:17:54]Rotation functions proper I guess.

[00:18:11]What is the issue here? Oh, they asking rotate K by right places. I think I have done for the left place.

[00:18:23]How do you do for the right place? It should be reverse, right?

[00:18:27]I think um I think it's if this is for right then it should be coming in middle I guess and uh we will be rotating rotating from zero till end first and again we'll be rotating back I guess I don't know this is not even rotating I think why like why my rotation function not A rotate function should work fine.

[00:19:28]Since we have a K places, are we not using the K thing? I think I have missed something. It should be from 0 till K and K till zero.

[00:19:38]Okay, this should be this should be K I guess.

[00:19:50]Are you getting wrong answer? Not even any rotation happened here.

[00:20:20]Hey, can't we can't we just convert the link list to because of Oh, I think um this part is not working. I guess maybe what we're expecting is not getting over here. I guess I don't know.

[00:21:02]What do you guys think?

[00:21:10]Do you guys have any idea like what can we do? I think this should be like zero.

[00:21:18]This should be zero and this should be K. I guess for the right one and for the left one it will be opposite.

[00:21:27]Uh maybe the storing part is wrong I guess. How can we store this?

[00:21:33]Maybe let's iterate over the head element.

[00:21:37]Current equals to head and until our current is there. current is not equal to that. What we do is uh let you just push the element inside just push current.

[00:22:20]current should current next move.

[00:22:26]Now our head should have the proper value for this thing and uh rotation also should work I guess since our starting should be for zero for this one and uh if we are doing it for the left one then it should be like 0 till k minus one and after that k k till end of the array and the whole rotation of the array but here since you're doing for the right side we have to do it little different this should work bro if this is not working then you need to see what is error something wrong here what does it say I don't even have line 57 somewhere okay let me console the head why it's saying me can't Uh back written list. Oh [ __ ] Is it possible?

[00:24:00]What the [ __ ] am I even searching, man?

[00:24:14]The only way of doing is like we have to again iterate back to the head. I guess they're using end spaces for doing that thing.

[00:24:23]What are they doing? Checking if length is in head. They're creating new list array. Oh [ __ ] Why are they doing zero?

[00:24:40]This part is not understandable.

[00:24:48]Oh, this is cool. Array reduce right.

[00:24:51]Oh, they're using this. Are they using this this thing or like concise ways use rad which builds a list from the end of the front?

[00:25:05]Okay, let us try this.

[00:25:13]Uh can I just manipulate the head array now?

[00:25:24]This head I don't think this is possible.

[00:25:39]What is this? Rad iterative iterative is iterative iterative method. It runs reducer all the functions over all elements in array descending and ascending.

[00:26:03]It's only used for printing in descending and ascending.

[00:26:08]Will it convert my array back to English or not? That is what my question only thing need to be done is like we have to convert back to blink place.

[00:26:31]Does this really work?

[00:26:33]Can I even do this thing?

[00:26:36]Let me run once.

[00:26:42]It worked for the first one, but it failed for the last. Why?

[00:26:48]Did it go out of the bound? Oh, it did not even rotate.

[00:26:54]I think we have to do it in a different way.

[00:26:59]So, you already have the head.

[00:27:02]What we have to do is iterate over the array and just push it inside the base or maybe we can create a new link.

[00:27:11]Please let result to new where is list node. This is not supposed to new list node. Uh does it takes anything in it? It is value. Next we have to create separate separate link link uh list node for everything since we have rotating here.

[00:27:45]We are getting error while my current is there until then you'll be getting errors 452. Okay, this is fine.

[00:28:05]Check for the second test.

[00:28:09]Did it show for the second test?

[00:28:12]The first one is right. I guess first one is 4512 3 4 5 1 2 3 Now we have to create the link list and push the elements inside it. I next can't I just create a new What is this thing gives me?

[00:28:45]I'm doing it in a too much complicated way.

[00:28:51]Let me let me comment this thing so you don't get the error.

[00:28:58]I'm making it too much complicated.

[00:29:01]So we have a zero here. So this is literally empty I guess.

[00:29:07]Uh let's rename to the let's keep the result itself. Now what we can do is like uh do a for loop and uh that I I will go till this should happen after after the rotation. So I might be getting the wrong answer later. So I will just make sure to put that thing here.

[00:29:34]And now we have to only connect everything together. That's it. First value you take and connect to the second Okay, let me ask you for something.

[00:30:31]We are very close and approach converts and rotate and rebuild is totally fine.

[00:30:36]This part sucks is just rebuilding the link list from the array.

[00:30:42]This stuck this part is stuck on there is rebuilding the list from array. The problem in your current code you created one node and you're not linking new nodes. You need to build a chain using next start like this.

[00:31:07]I have to I have to first assign my result as of zero. So it will contain the first element.

[00:31:17]Where is that? Where is it?

[00:31:24]How is it?

[00:31:28]Okay. Now we have okay now we have a zero element and now we have to only iterate over the thing and just complete this thing but let my current will be result current is used to build the list where is pointing to the So if you print my result, if I print my current then I will get my first print one. Are you getting some error?

[00:32:15]Current has been already declared. Okay.

[00:32:19]Uh, load.

[00:32:37]We're getting four. Okay. The first one, the first value. Fine.

[00:32:42]What we need to do is like iterate over the current and do next and do it. Uh how do you assign a value there?

[00:32:51]Should it be current to head area I and current next? Will this work?

[00:33:12]This should work. I guess it will start from zero. It should start from one right then since we have already stored the first one thing here first thing here. So start from the first element I will start appending inside the val and move to the next pointer here.

[00:33:30]Oh [ __ ] Let's hope it works.

[00:33:34]So I'm supposed to return the result.

[00:33:43]I'm doing it in a too much complicated way. Oh [ __ ] Cannot set the property of null to the uh what does it says? Cannot set a property of null. Can I use a while my current max notal until then you values it current will become my oh [ __ ] how do I how do I point the current value right now can I make it won't be pointing.

[00:34:32]How can I just take a pointer here? Let articles one I'll put a start here and uh do start plus once it push the value then it should move to the current next and after that start should become ++ so it ends until my current next is not done you store the head start value then move to the next pointer Change the start pointer so it will change the value.

[00:35:08]I hope this works.

[00:35:10]Finger crossed.

[00:35:12]Still getting n this was not supposed to be null.

[00:35:21]Okay, let me put until my current is there. Till then you do.

[00:35:27]Why I'm getting current as? Okay. Okay, I made a mistake. I need to I need to use current node since my other variable here named as current is uh giving me some errors.

[00:35:44]Now we have the current node current node and everything and this can go to this thing.

[00:35:52]If my pointer is right then you should go oh my god I got everything wrong bro.

[00:36:00]What the [ __ ] Why no values were pushed?

[00:36:12]Since I found the issue until current I and current next element Run.

[00:36:42]Oh [ __ ] bro.

[00:36:58]What is it saying? Null again. Why getting nerfed? So many nerves.

[00:37:03]Current is supposed to not be null.

[00:37:07]Did I do some mistake here?

[00:37:15]Mistake right now.

[00:37:30]Um Should I create a new new new new list inside.

[00:38:32]The next node is null. So when you do you move to the null you try then you try to add value inside it.

[00:38:40]You only created one node. What do you mean by have to create every node?

[00:38:44]You're not creating new nodes inside loop.

[00:38:49]Don't override. You already set the first value.

[00:38:53]After that you create a new not you should be doing instead this I have to create a new value not modify.

[00:39:14]Okay, I need to do this current node will be okay. I need to create new new nodes not like this.

[00:39:27]What was here? New list node of how is this even working? Oh, it should be like next next and after that uh after that we can do this thing but should be val right setting the value right first node represent the value not modifying val current one everything's fine I guess now this should So what we did was we rotate wrote a rotate function and after that we converted this to array again and rotated it places right and after that we writing back to the result and now pushing I made it too much complicated is this because of zero the second one did not even rotate Ready?

[01:30:16]What are you doing?

[01:30:22]Split into parts.

[01:30:58]How do I get the value like this thing here?

[01:31:05]First node will contain the value of the text.

[01:31:09]Okay.

[01:31:13]First will be inside this and next to implement this thing.

[01:31:47]split into parts.

[01:32:16]So imagine we have been given this whole thing.

[01:32:30]Yeah. When did you message me?

[01:32:44]BJP won. No. Congratulations.

[01:32:48]I'm not more into the politics, but still congratulations.

[01:32:55]Uh, easy. Wow, this is easy.

[01:33:01]But they given staff level, bro. L6 for this thing, I guess.

[01:33:06]What is staff and L6 proficiency?

[01:33:11]uh like an SG3 at Amazon or maybe big tech companies I guess f or if you know how to split the English then this is not a top tier question I guess they given me k value I need to split this head into um equal parts I guess if it is not there then we have to push some empty values I staff staff level is think L6 L6 in fan man and big tech companies.

[01:33:48]I did Google for that.

[01:33:51]What does staff means in fleet code?

[01:33:55]A staff software engineer role often L6 or equivalent higher level system design and uh yeah kind of big big tech guys.

[01:34:14]What the [ __ ] I'm not L6, bro.

[01:34:18]Oh, you're L6. Nice.

[01:34:24]What need? What should be done, right?

[01:34:29]We have been given a head and uh we have to return a list node and we need to split them into k equal parts.

[01:34:44]The value is given as three but why are we having four values here?

[01:34:48]What [ __ ] is this?

[01:34:51]He could have done 1 2 3 and 4 5 6 7 8 9 and 10 11 and 12 for that he would have left empty man draw.

[01:35:07]I'm really bad at explaining.

[01:35:12]Look at this. I could not even solve this thing. I took the problem but I could not solve it.

[01:35:20]Okay, they're saying like um you'll be given a head. So, this is head right.

[01:35:30]Pardon me, man. Like uh I'm using my mouse to write whatever I'm writing here.

[01:35:35]So, this will be your head and k will be given. Imagine if k is two.

[01:35:41]What we need to do is take this two and uh put it in the result array.

[01:35:46]So what will be one two?

[01:35:50]A [ __ ] bro.

[01:35:54]This will be the first kind of pair I guess. 2 three and so on. How many we have? One 2 3 4 5.

[01:36:13]If you're getting even number then then splitting is easy. Getting odd is harder I guess. Three 1 2 3 1 2 3 1 2 3 and 10 is left.

[01:36:28]But what they did is like 1 2 3 4 and then they did 5 6 7 and then they did 8 9 10. Why? But the value was given three. As for the first example, the first one was given like 1 2 3 but the K value was five. I guess where is that thing here?

[01:36:56]Here we here we have only three elements 1 2 3 but K value was five.

[01:37:04]So what you did is like uh He took the first value and stored it here. Second value here and third value here. After that he just put two empty placeholders. But why do you need to do it here? We have to only find the K k= to 3. Then it should be 1 2 3 and 4 5 6 7 8 9 and 10 11 12 will be like empty array. I mean empty placeholders.

[01:37:42]No, here they given three man.

[01:38:07]I can't understand this, bro.

[01:38:14]Input has been split into consecutive parts with size difference almost one and earlier parts are larger than the size and later later parts.

[01:38:32]Input has been split into consecutive parts with size difference at most one.

[01:40:18]Oh.

[01:40:22]Twitchy twitchy.

[01:40:34]Oh, we got four followers.

[01:40:49]The [ __ ] Why is this chat not working, bro?

[01:41:15]So many people are alive. Sorry. Alive.

[01:41:19]Al life.

[01:41:23]He killed everyone.

[01:41:26]What the [ __ ] What is a lead code?

[01:41:35]What is a lead code profile? Huh?

[01:41:41]What is a lead code profile?

[01:41:44]Are you asking my profile?

[01:41:50]My dumb profile, bro. Dumb profile.

[01:41:54]Dumb bust profile.

[01:41:57]This is This is my profile.

[01:42:01]I'm staying undercover right now. Like I'm from Western Sahara.

[01:42:08]What the [ __ ] Why am I even sitting in the PC, man?

[01:42:24]Like, nobody there. I mean, he's he's there, but he's not sleep.

[01:42:30]Oh, I'm top 98%age.

[01:42:33]Oh, you mean I'm like out of 100 people?

[01:42:36]Like, I'm I'm on the place. I'm like 80 I'm in 98%.

[01:42:42]What does this say?

[01:42:45]Holy [ __ ] 44%age. Did I even do this many? I did not even remember like I'm doing this thing. I only attended five, man.

[01:42:56]How How is this even possible?

[01:43:00]These these many people attended the What the hell is this?

[01:43:08]And when will I get this thing?

[01:43:17]What the [ __ ] is 98%?

[01:43:26]We have zero questions or wrench is like zero questions on what is wrong with your wrench.

[01:43:43]I think I can get it here.

[01:43:46]Uh, it's W3 NCA. See, this is how we did. Uh, I mean, what do you say that?

[01:43:53]Doxing.

[01:43:55]This is how we do uh dox people.

[01:44:00]What the [ __ ] W3NCS.

[01:44:05]This is what I type, bro.

[01:44:11]W3NCS.

[01:44:14]There we go.

[01:44:16]This is you, right? Yeah, this is you.

[01:44:19]Golang Python. Yeah, this is you.

[01:44:23]See, this is how I You follow me? What the [ __ ] Why are you following me, man?

[01:44:31]Oh, you're top 29, bro. Damn, bro. Top 26 percentage.

[01:44:35]Like 74K people have attended there.

[01:44:40]Oh, your graph is crazy, bro.

[01:44:45]You have been grinding from last year.

[01:44:49]Wow.

[01:44:53]Keep going, brother.

[01:44:57]Do you solve more than 10 questions a day or what?

[01:45:02]3 years. What the I think this is your second profile.

[01:45:10]You're lying to me. I'm following you while I'm following you. What is box?

[01:45:21]Let's let's do the arrange uh what what do you say this portfolio right?

[01:45:31]A security focused learner while learner working through CTFs, labs and real world attack surface to understand how system actually breaks, how to fix, stop attack before they happen.

[01:45:46]Oh, where is your certification? You have to mention certification. Let's oops 44.

[01:45:57]What do you have in archive?

[01:46:00]Oh, all this I think I think all these write ups I guess minimalisms is intentional clarity over noise. What is this?

[01:46:16]Ah [ __ ] I became god now.

[01:46:23]My eyes are gone.

[01:46:30]No search done by me. When are you planning to do then? Contact leak everything. Yeah, let's go. We leak our uh Ren's.

[01:46:41]This is our Ren's uh email and uh what the [ __ ] is this?

[01:46:49]I sing communication.

[01:46:57]It was nice doxing the wrench. I guess what do you have in the GitHub then?

[01:47:07]Somebody wants to flex in the I mean somebody wants to flex their lead code profile or GitHub profile. You can share you can share the username. You can share the username if you want.

[01:47:18]I'm just doxing everyone now on the live.

[01:47:22]Hey, did did did you guys hear this music? Uh, I made it using the AI.

[01:47:29]Where the [ __ ] is that?

[01:47:33]Listen to this.

[01:47:36]Yeah, it's for every dev. Still stuck in tutorials.

[01:47:44]Still waiting for that first offer.

[01:47:46]Cold guy in the cold base.

[01:47:49]Let's go. I wake up late, laptop on my lap. Another day where I'm stuck in a trap. Le code open. I'm staring at trees, but my brain says, "Bro, just let it be." Functions break when I think too hard. Life feels like a badly written card. Merge conflicts in my real life script. Every dream feels like it might just slip. Apply to jobs. Got we regret to inform. Now the rejection feels like the norm, but I still type code when the world goes mute. Trying to turn the struggle in to prove. Yeah, I'm down, but I'm not done. Every failure just makes me run. One more try, I reload the pain. WATCH ME TURN IT ALL AGAIN. I'M cold guy. I build from zero. Working dreams to a golden hero. Fall out, but I don't stay down. I turn my loss into my crown. I'm cold guy. Still in the fight.

[01:48:33]Cing through the darkest night. Don't die yet, but I still create. I build my future. I don't wait.

[01:48:40]Now I'm switching stacks like I switch my mood. Full stack grind. Yeah, I stay in the loop. React front hand back and flow. Trying to build what the companies want to know. D say pain still hits my head. Binary search, but I feel half dead, but I debug life like I debug code. Turning pressure into a stronger mode. Gen tools in my workflow now.

[01:48:59]Making smarter apps. Learning how not to syntax. I think systems building solutions. Breaking limits. They see results. They don't see nights. They don't see struggles. Only highlights.

[01:49:09]But every just my way. I'm getting closer. Every day I'm golden guy. I build from zero. Following dreams to a golden hero. All I break, but I don't stay down. I turn my loss into my crown.

[01:49:21]I'm going guy. Still in the fight.

[01:49:23]Golden. The darkest night. No time yet, but I still create and I build my future. I don't wait.

[01:49:30]Now I see it clearer than before. Every rejection open the door. Not hired yet, but I'm still in motion. Coding my way like an ocean. One day off a letter in my hand. Till then I'm building. I make my stand. From stack overflow to life control. I CODE MY PATH. I OWN MY ROCK.

[01:49:47]I'M GUY. I BUILD FROM ZERO. Dreams to a golden hero. Fall. I don't stay down. I turn my ros into my crown. I'm guy.

[01:49:56]Still in the fight. Going through the darkest night. No, but I still my future. I don't >> randomly kill processes in the background to optimize the system.

[01:50:09]>> So every still figuring it out.

[01:50:12]>> You're not behind, you're just building code guy out.

[01:50:21]Has 31 has 31. Damn.

[01:50:28]How was the song, man?

[01:50:31]It's all created by [ __ ] AI called as what is it?

[01:50:37]I guess yeah.

[01:50:43]Okay.

[01:50:45]What is walk? Are you walking somewhere in the walk?

[01:50:52]Oh, you you're a BTS fan.

[01:50:58]Is this BTS or like something different?

[01:51:03]I don't think it's BTS.

[01:51:06]Maybe something similar to BTS. I guess I don't know who is BTS.

[01:51:14]You have 188 star. I'm [ __ ] crazy.

[01:51:19]Did you start 188 repos are like Oh, you start mine. What the [ __ ] I have only three stars.

[01:51:34]What is this?

[01:51:49]>> What the [ __ ] I'm not I'm not [ __ ] fan of BTS, man. What the hell? I said I don't know BTS. He didn't say I know BTS and I love BTS or something like that.

[01:52:00]Um, fiber. What is fiber, man?

[01:52:19]The hell is fiber? Fiber is a language.

[01:52:23]I never heard of fibers.

[01:52:26]You have it in the tag.

[01:52:32]Is this elen ring? It's look it look like an elen ring thing or transformer. What the hell is that?

[01:52:45]Okay, let's code. I mean, let's uh solve this brick thing. What the hell did we?

[01:52:57]So whenever our K is greater than um how do we say that K is greater than our length then we can insert the empty values at the end.

[01:53:16]Otherwise what we need to do is like split the array before we even start splitting. I mean like making up the pairs. I guess if the value is three then what we need to do is check do we have equal pairs of three here. We don't have equal pairs of three right. Do we have we don't have we have one here. So since we don't have equal pairs of three what we need to do is like first we have to take one more here.

[01:53:45]I don't know this will increase I guess I don't know how will I manage I think oh okay I don't know what the hell is that something similar to that in Elen drink what the hell is the name of the boss Fire boss, I guess.

[01:54:21]Ah, this is the one. This is the one.

[01:54:25]Ah, this one. This one. It looks similar to that. See, see this is what you had. I guess you see this wrench. Same, right?

[01:54:40]Uh, it was standing in the same position, right?

[01:54:48]10 C.

[01:54:51]See this profile and uh see this image looks similar, right? This one and this one. This one and this one.

[01:55:00]See, this is why I told Elden Ring.

[01:55:08]Bro, this question is so hard. Bro, we need to even determine before we even start splitting the link list. How do you even split the link list? Um, do you need to create a separate note for everything? Whenever you do this then we have to maintain all these values somewhere so we can just get it quicker as possible.

[01:55:42]Why is DOS is sitting in the VC alone bro?

[01:55:48]Who heard him?

[01:55:51]He did not even reply bro.

[01:55:58]Um, this was asked in the weekly contest 58.

[01:56:02]Did Did I enroll in the next contest?

[01:56:11]I don't have to. I guess Oh, I did not even register.

[01:56:21]Okay, this is registered.

[01:56:26]All right.

[01:56:28]If my value is three and k is five, then it is obviously greater than the value.

[01:56:37]Obviously greater than the value. So we have to split.

[01:56:48]All right, I'll be right back after my lunch. I mean sorry dinner.

[01:56:55]You going to [ __ ] hand it?

[01:56:59]Where's the opacity and stroke?

[01:57:05]Oh, this is wrong. It should be like this.

[01:57:12]Wow, my handing is so good, bro. Even on the mouse.

[01:57:52]Okay, be right back after my dinner.

[01:58:05]You guys can have fun until that if you guys can start or give me some hint here. So, it will be really useful for me since I don't know how the [ __ ] am I supposed to do this.

[01:58:26]Let me share the question link. If you want you can join. Until that I I'll finish my dinner and come back.

[01:58:36]Don't copy paste from this RGBD. Man, we could learn. We'll learn together.

[01:58:42]Since I'm doing the same, but I'm still saying you to not do. Let me share this so we could learn in real, I guess.

[01:58:55]Join this link. Join this link.

[01:59:06]Join this link. If you cancel then uh don't copy paste from the charg until that I'll just have my dinner and be right back in few minutes or like I'll be back in 7 minutes or 8 minutes.

[01:59:21]I'll do as much fast I can as possible man from my side since I don't have time tomorrow I have to go to hospital after my elder brother for my mama's I mean my uncle's uncle's son be right Hello. Hello.

[02:19:58]Okay.

[02:20:09]How to do this question man?

[02:20:14]Length of each part should be equal as possible. No part should have a size of differing by one more than one.

[02:20:27]If my k is greater than my length of this thing, then we need to if k is lesser than uh uh the total number of pairs I guess then we have to increment one in the first and rest will be same I guess.

[02:20:51]But if it is greater then we have to do it in this way. How do we store an empty value? Will it be null? Even null will be shown here. Null. We can't store empty. I guess you store an empty undefined. Okay. Given. You can either store undefined.

[02:21:14]What is this?

[02:21:35]join if you want to solve this or you can solve.

[02:21:51]There's a chat over here.

[02:22:03]Uh this is not needed. And okay, I think this is too big. Make it smaller here.

[02:22:17]Now it's good.

[02:22:21]Okay. Okay, now I'm able to see the chat as well as the question as well as my coding panel.

[02:22:29]Now I need to just figure out how I can make them pair with each other.

[02:22:35]Should it be length of my should it be length of my this thing uh list divided by k then will we get the equal pairs?

[02:22:47]Okay, so many people join.

[02:22:50]Alice, do you guys know JavaScript or should I shift it to the C++ or Java?

[02:23:04]Which language do you prefer?

[02:23:06]I just want to learn. So it doesn't matter for me like which language you prefer.

[02:23:15]In the end the solving matters and how we are solving it.

[02:23:26]Okay. So if we divide the total elements with K how many pair we getting one.

[02:23:40]So we have 10.

[02:23:53]Yeah, we we getting the total number of element needed for that uh when we have three.

[02:24:05]This is something wrong for the lower value. But when it is higher then we are able to figure out how much we need for the pairing of 1.

[02:24:21]when we do 10 / 3 then we're getting three which is like equal pair we need to figure out and but for this thing we are getting wrong I guess no when whenever our k value is greater than our disc value then we have to divide the k value by list size then we are getting a decimal point answer uh let me show LC.

[02:24:56]So the length of my this thing is 10, right? 10 / 3 is like 31 3. So we get three and very is clean. Okay. Now we have k = to 5 and head is head length is like three.

[02:25:17]So what we can do is 5 / 3 you get 1.6 ignore the six and 7 you get one which is this this value.

[02:25:28]So whenever k value is greater than that then we have to divide the k with the total size and whenever our k is lesser than my total size then divide the head length variable a. So we get the number of pairs we need to form. Right? Now we only need to do is like uh return the pair.

[02:25:53]We found out how can we how can we uh get the total number of pairs required for everything.

[02:26:02]Now only thing is left is we have to just return the p.

[02:26:13]Now we need to find how can we return the pattern.

[02:26:18]divide the k. Uh okay let let me write simple simple a divided by h size is smaller if k is greater else um maybe head size divided by k value which will be like equal number of number uh items needed better.

[02:27:02]Okay, people left. Why people are leaving? Anyone know JavaScript?

[02:27:08]Anyone wants to join?

[02:27:11]If anyone is if anyone is interested to join My is sitting still in the DC, bro. What happened to Das?

[02:27:50]is sitting alone like past one hour.

[02:27:53]Maybe he's focusing on something and shing on. He just joined the channel.

[02:28:00]Possible.

[02:28:03]What do you call them?

[02:28:08]Pomodoro.

[02:28:12]This is over the total number of element needed for the pairing up and we need to up my K value is lesser than you have split.

[02:28:31]K is greater.

[02:28:33]Whenever K value greater then you have to split.

[02:28:37]When your keyword is lesser than my total length then you have to join.

[02:28:43]Oh, do I need to form a new list for everything like we did for the past question?

[02:28:59]Since for the past question we did this thing right uh where is that list thing we created every new list node and appended the array element whatever is there in the head array and we got the head array from the head can't we just do the same thing for this thing and only push uh I mean only slice and push until the number required But this is wrong way of doing that thing. I guess this shouldn't be that hard.

[02:29:43]We only have to do is like slice if k is three then we have first we slice three.

[02:29:50]No, if if this is greater than my if this is lesser than my element and then what we need to do is first we have to pull four elements and after that whatever is given then 3 33 3 but in the end you should not give uh empty one only one is uh allowed when k value is greater than my total size Uh okay let's try by brute forcely how people will do if they don't know link list example mean if I don't know the link list how will I do this first what I will do is like I will push all the values into my array and after that I will slice them and put it back again there I guess but this is long way of doing but uh still you can check if our logic is working or not. Once it works then we can learn how to do with the link list then.

[02:30:58]So for adding the value inside the array we know already we did right like you can just keep ahead a r and while my current is there until then what you do head a push current.

[02:31:33]Do you need to do current val? I mean do I need to do again current next to move the next element or it's needed since it will not work after the next element. So we have to do it's like++.

[02:31:54]Now we should have all the values inside the header I guess.

[02:32:06]Oh, everyone left. Why everyone's leaving?

[02:32:11]Oh, we have all the values. Whatever was needed for that thing. Now we have to only slice and append, bro. That's it.

[02:32:17]Boom. We done then only what we need to do is like slice and append as for the condition but this is not the right way of doing the linguist questions I guess I'm doing in a different wrong way maybe an iterative approach on my own I'm just making my own simulations what we need to do is slice K is given You have to slice and uh slice and move it in. Right.

[02:33:06]Now slicing operator is slicing operation.

[02:33:10]How will we slice from the starting index till K index after that we have to make our isk or what?

[02:33:25]Let me try if I slice. Okay, let me keep on result for that.

[02:33:33]Even then everything will collapse man like it is array of array inside array we have another array and another array and another array I don't think this will work let me Okay.

[02:34:03]Is he writing something or like he's keeping the cursor where Oh, he's doing something.

[02:34:11]Cool, bro. Do whatever you can.

[02:34:14]slice from my I till K index. After you uh slice, then you make my K.

[02:34:25]Is it right or wrong? Like what the hell?

[02:34:31]Let let me let me store this index current index.

[02:34:38]So what will happen? My I will become current place.

[02:34:44]This should split everything. Right.

[02:34:49]After you slice, after you slice, then what you need to do is like push into the result and pushing into result have a different way of it.

[02:35:04]Can I current index but current index will have only the value. I guess we need to pass header slice.

[02:35:17]I comma K K. K minus one.

[02:35:21]No [ __ ] idea. I know. I know this will not work, but still I'm just trying to know something is off.

[02:35:32]This should throw an error right now.

[02:35:34]Yeah. Here we go.

[02:35:37]Oh, this is header A. Sorry. Header A header slice. I don't think this will work since my header is not an array.

[02:35:51]Since header is not an array, slice operator won't work.

[02:35:58]Okay, it is it is an array. But since we're doing it inside the for work slice should work.

[02:36:08]Do we really need this slice?

[02:36:11]We don't have anything in the slice.

[02:36:13]Nice.

[02:36:16]Why is this happen?

[02:36:19]If I console down the current index, what do we have here?

[02:36:27]Current index really have the slice value.

[02:36:32]I got a runtime error right now.

[02:36:44]We are getting 1 3 1 2 3 and we were supposed to only slice since a file.

[02:36:54]Oh, slice. What does slice do? Slice slice from 1 to K. Y to K. So Y to K will be like the value is given five. So it will slice everything.

[02:37:04][ __ ] We need a different approach right now.

[02:37:20]Krishna is doing something. Let's go.

[02:37:22]Krishna, put something hard.

[02:37:31]Yo, guys. Need help, man. Need help.

[02:37:33]Need help. Help. Slicing is completely off. I guess this won't work as I is not working.

[02:37:56]If K is greater then we need to size one thing. If lesser then we need to size everything together.

[02:38:08]Yeah, let's go. Krishna is fixing my syntax.

[02:38:12]I + K. Oh, I + K minus one.

[02:38:19]How this will work?

[02:38:25]Okay, let me let me tell him like don't submit uh just what is the output? put now.

[02:38:59]So our result is empty right now.

[02:39:03]It shouldn't be empty.

[02:39:07]We should at least have the current.

[02:39:12]Oh, he added something new.

[02:39:15]We still got push.

[02:39:19]Can we add a green thing here? I never saw this thing.

[02:39:33]It can only have a start and end, right?

[02:39:35]Yeah. Start and end. Optional. End is optional. I don't put end, then it will automatically take until end of year.

[02:39:50]Oh, we can even copy an array with slice. Damn, bro.

[02:39:55]Get from the index to end changes the original Peace.

[02:40:29]Are you asking why I'm doing console or Uh I can do it in any language but doesn't matter.

[02:41:11]Java Java understand a bit I guess they should be same right like next and uh we have next we have next Why did he switch again?

[02:41:58]Did it go or what? I'm not able to see his cursor right now. Is he inactive?

[02:42:05]If anyone else wants to join, then they can join. Man, this question is like [ __ ] my brain right now.

[02:42:14]Your JS code was almost right. What the [ __ ] are you saying? It won't work, I guess.

[02:42:47]It can't run. Okay, it won't work until we fix the slides and uh moving to the next indexing.

[02:43:01]This is not possible.

[02:43:05]Slice and up.

[02:43:08]If index is greater than greater than if greater than this then instead of doing the string current is not even k I think that will If my K is greater than my head.

[02:43:50]Oh, since I do this thing. Okay, can do this. Since you're taking everything as single value, right?

[02:43:58]Then what we need to do is like push