Dumbest guy doing leetcode live day 43

Añadido: 2026-05-18

[00:02:14]Given an array of nonative array, we are initially positioned at start index of array.

[00:02:26]When you are at index i, you can jump to i + a r of i or i minus a r of i. Check if you can reach any index with Z 1 5 4 All possible ways to reach at index three with value zero are you mean I have to reach from here to here using this index five to four. You have to minus one second.

[00:03:54][ __ ] I can't even understand.

[00:03:58]Given an array of non integer a r, you are initially positioned at start index of array. When you're at index i, you can jump to the i plus a r of i or i of i. Check if you can reach any index.

[00:04:18]Check if you can reach any index with us.

[00:04:23]Check.

[00:04:29]What does that mean?

[00:04:34]There are no ways to reach index one with value zero.

[00:04:46]One possible way to reach at index three with value zero. 0 1 0 1 2 3 is index 4 again.

[00:05:06]Uh uh.

[00:05:11]Is this a DFS search? What the [ __ ] I thought it was an array problem.

[00:05:36][ __ ] I can't even process the question right now.

[00:05:42]Even an array of non integer neon non- negative integer r initially positioned at five I mean start start of index array.

[00:05:58]When my start is five, then it should be 0 1 2 3 4 5. So then then my start would be like one.

[00:06:10]What are they saying? Do I need to resill the first index or we have to add up all these values and check if we can reach to the first index.

[00:06:58]I need to find the possible path that will lead me to the first value of the element array.

[00:07:11]So why is this question so hard, man?

[00:07:33]Given an ar of non- negative integer a r you're initially positioned at start index of array when you're at the index i you can jump to i + 1 or I minus array of I check if you can reach any index with value zero check any index how can I reach from that index I mean do I need to check if I can go here or here value zero all possible ways reach index three with value 0 or maybe it can be like 6 - 5 6 - 1 4 - 2 I mean 4 + 1 what is this bro this a hard question.

[00:09:13]Literally, I can't even understand the question right now. What the hell?

[00:09:59]How is this even working?

[00:10:16]So you are given an array of non negative integer and you initially positioned at start of the index at the start index of the array. So this is my start index.

[00:10:30]So which means this is one sorry this is zero this is 1 2 3 4 uh I mean this is the fifth index I guess 0 1 2 3 4 this should be fifth index I guess won't be considered as index 1 2 3 4 okay let's consider three itself Since there they have told the question since they told like all all possible ways to reach at index three which is like this. So this is uh let's consider this as a fifth index. Uh since array is zero index and okay so if we start at the fifth index now what do I need to do now?

[00:11:34]When you're at I index I, you can jump either to ar I + array of I + Y. Why I plus?

[00:11:51]Imagine if I at uh three, right?

[00:12:01]So if we are at three 0 1 2 3 where is if we are we are at here like imagine if we are at three then they're saying uh you have to add i + ar of i. Oh which is uh so this is zero right? 0 1 2 3 4. So if I add if I add this thing then what will my answer will be?

[00:12:38]It will be six I guess third index plus the next index which is our start index.

[00:12:48]This one our element is at five right.

[00:12:52]So if I add current I value which is three and my element value which is three it will give me six.

[00:13:02]And what are we supposed to do with the six? Now check if you can reach any index with value zero.

[00:13:15]Check if you can reach any index with value zero. This is not understandable.

[00:13:23]Check if you can't reach any index with value zero.

[00:13:29]Are you saying I have to subtract this?

[00:13:33]I mean if if I'm at fifth index and if we add this together we get six.

[00:13:43]We get six right six. And if I subract this back then it is two again.

[00:13:54]Again if you sub this one it will minus one.

[00:13:59]So we have to reach but in index with value zero. This is what the [ __ ] is this?

[00:14:07]Check if you can reach any index with value zero. So if you can reach any index with value zero when you at index I when you're at index I I'm my current index is this one uh three right now here and you can jump to the I + I + I six or uh this is fourth integer then this will be of six array of uh uh I minus I - I right I - I so this will be like 0 and this shouldn't this give meus same this is the beginner But what the hell can you can check if you can reach any index with value zero?

[00:15:20]Notice that you can't jump outside the array any time. All possible ways to reach index three with value zero or index five. Index 4 index four.

[00:15:37]index one index three index one index five index six index five six index 4 index one index three which is this one this one uh >> they have given me an area and they have given me starting position in the index of I when you're at index I you can jump to I + 1 or I - 1 I minus of I check if you can reach any index check if you can reach any index can I reach any index from here yes I can reach Here I reach it here. Even I can reach here.

[00:16:42]What the hell is the question? Why am I getting the falls here?

[00:16:56]Input a r of 3 0 2 1 1 start equals to output false. There is no way to reach index one with value zero.

[00:17:09]There is no way to reach index one value.

[00:17:15]We have to calculate the values and check if we can reach till first index.

[00:17:20]I can't understand the question. This is my 0 1 2 and my two is currently on this this one here.

[00:17:31]And if I move here which is 1us.

[00:17:41]So we have to go on the front side. That's it.

[00:17:50]Oh the I going to ask the AI to explain me the question. I'm not able to understand it.

[00:18:20]You are standing at index zero of array.

[00:18:23]At every position I value array of I tells you how far you can jump.

[00:18:28][ __ ] I knew that. That's what I was asking.

[00:18:33]From index I, you can jump forward position or backward position. Check if you can reach any index with value zero.

[00:18:40]You're not allowed to go.

[00:18:43]Son of a [ __ ] bro. You're saying the same question again. Like, what the hell is this?

[00:18:51]He literally explained me the same thing again.

[00:18:57]At every every position I the value of array of I tells you how far you can jump.

[00:19:06]Every position I the value of ar.

[00:19:10]So if I'm at start see 0 1 2 3 4 and this is my fifth element right 1 2 3 4 5 so this is my fifth element and what are they saying? Do I need to reach till the first index?

[00:19:37]Check if you can reach any index whose value is zero.

[00:19:48]Oh. Oh [ __ ] We have to reach zero.

[00:19:53]Uh if we're able to reach zero, I mean yeah we can reach here.

[00:20:02]012 012.

[00:20:05]Can't I reach here? Why I can't reach here?

[00:20:14]There is no way to reach index one with value zero. Why? Why I can't reach?

[00:20:22]Since my two is bigger than zero and I have to calculate the index, right?

[00:20:28]I need to subtract the index. So, which will be like my first index minus this value.

[00:20:35]Then I should be able to reach here. Why is this pause?

[00:20:43]Hello. What's up?

[00:20:47]Bro, I'm stuck with the question, man.

[00:20:49]Like I can't even understand the question. Now what I understood is that I need to uh check if from my start index which is the start value uh this is 0 1 2 3 4 which is three here and I have to check if array of i + 1 uh can I not ar + 1 I mean uh yeah ar + 1 yeah ar of i + 1 or area of i - Does that lead me to the uh index where value is zero?

[00:21:27]If it is there then it is true.

[00:21:33]Let me see where we are getting false here.

[00:21:43]Okay. Yeah. Minus minus one can't be the index of an array since it is outside of array. Oh [ __ ] Oh [ __ ] Okay.

[00:22:06]either a r of i + 1 or a r of uh i - 1. This is what they gave right.

[00:22:24]Sorry, not ius one. Sorry, not ius.

[00:22:29]Oh, even even the order matters are what?

[00:22:35]I don't know if the order matters. Even if I do this, it should be the same, right? Either it can be array of I plus this thing or like I this thing.

[00:22:50]Problem of the day I plus a R of I.

[00:22:58]So now we have to calculate and see if my if my index is going out of the bound or not.

[00:23:05]If it is going out of the bound and you are not able to reach zero then we have to return uh false otherwise I have to return true there is a question I guess I don't know if this is the question then we have we can just proceed with that I will be my start and I will go to go to length Let current equals to 100.

[00:23:51]I + of I.

[00:24:03]Let's run. Let's get back index.

[00:24:26]Yes.

[00:24:38]If my front index equal to zero I need to return front end equal to true. uh we are calculating if my a I plus a r of i this is a this plus this even this should be giving me false value I guess since 3 minus 3 - uh what is the index of x 0 1 What the [ __ ] 0 1 2 0 1 2 3 3 - 3 zero.

[00:25:49]Yeah. Okay. Okay.

[00:26:27]Will this work or not? Bro, they have to keep on result flag.

[00:26:35]They have to return again.

[00:26:41]Okay, I'm getting undefined. So, I have to return it outside.

[00:26:49]Let me keep on Uhoh.

[00:27:53]use regression. No idea man.

[00:28:05]So we did not even reach zero. How is this possible?

[00:28:23]whenever my front index is equal to zero then only I'm making the flag true then why the heck do I need to declare it false by default I'm getting very huge number.

[00:28:53]I have to do a ar Uh flag is not working.

[00:29:19]I'm really sorry.

[00:29:40]H my friend value is like I plus a of I and back back index is like I minus A of I and if my front index or back index equals to zero then I'm making a factory else if I'm checking if my See I'm checking if my back index and front index is not less than zero.

[00:30:12]If it is less than zero then I have to right What is wrong here?

[00:31:00]If I define my flag inside then I'm not not able to use the value outside and I think position from start I'm starting with the starting and you can either jump this from this and check if you can reach any index if I= even this should work right like print index is like I plus a r of i which should be never equal to How will my I + I be equal to Z?

[00:32:02]I think subtraction might work but I don't think adding them will get me error of zero sorry here I mean I mean zero imagine if we are at uh fifth index right fifth index and this is my fifth index from here if I subtract this 0 1 3 and five.

[00:32:40]This is not equal to zero.

[00:32:58]So meloic is wrong.

[00:33:08]They have told to do with the BFS and BFS.

[00:33:14]What am I supposed to do with the B?

[00:33:19]I need to check if um start complicated.

[00:33:28]If I have to do the recussion then how start from index and check what do I do + one in data But why is this not working bro? This is is this wrong solution or like I'm doing it in a wrong way or did I understand the question itself wrong?

[00:34:10]So you're saying that this will not work at all.

[00:34:17]Let me explain. Let me explain. Just let me know if uh uh if I had understand the question right they have given me a non- negative integer a ar r r and initially we will start with the start pointer which is five I mean here as per the case it's five and any index of array I mean yeah they given five now and when when you are at the index I so imagine if you're at index zero Now we are at index this thing right you have to come from the first index itself. I do I have to start from the start index only right.

[00:35:03]You can either you can either jump on i + a r of i or ius of i and this will be not equals to z.

[00:35:21]I think I have to compare something else.

[00:35:25]See my front index won't give me uh zero. I guess even my back index is not giving me zero.

[00:35:39]After checking my current index which is current index current index values is equal to.

[00:35:59]So will that be like this? All right.

[00:36:39]Okay. See If a i + a r of i is greater than zero then I have to decrease I we have to write I minus of I inside this.

[00:37:59]If my I + I greater than So paper.

[00:39:08]If uh while my start is less than end then until that this will run. Now we have to check if my uh H start index.

[00:39:42]So if I check my start less than equals to you need to check if my a r of start index equal equals to zero.

[00:39:56]If I use y loop then how will I add an i there?

[00:40:00]I can't add an i. Right? I need an i.

[00:40:04]pointer.

[00:40:06]Which index? Yeah, I think you know I is basically start where you are standing.

[00:40:54]Oh, so we need to check if my start index plus a R of start index equals to Z.

[00:41:21]is entered.

[00:41:35]Otherwise, we have to start = to start minus 100.

[00:41:55]Start index start and end.

[00:42:01]Start index= to Z.

[00:42:08]See, you have to check the lesser and greater Increment, decrement, start until you reach the value.

[00:42:50]So here error of I is less than zero then.

[00:43:08]here. Uh Bro, I think I'm doing wrong.

[00:44:02]How they do with the father?

[00:44:44]My start is less than that won't work I guess.

[00:45:40]Let me try.

[00:46:04]It's Now if I do error of error of I then it will be every time true since the zero exist in the array.

[00:46:46]You just go and check if my zero existing in the existing Why are they telling me if BFS Think of think of BFS to solve the problem.

[00:50:07]This is problem.

[00:50:46]Sorry.

[00:50:54]BFS BFS BFS question how they update regression they g so they have given me a start which is root something like root Start.

[00:51:37]Start.

[00:51:50]Now we have to do BFS, right? How do I do BFS?

[00:51:58]First we need to check the condition, right?

[00:52:09]If my start now we have to apply okay we can we can make this itself as an recursive function right how do I come Error of start= 0 otherwise I trade over the right and left side I guess.

[00:53:18]So if right and left side so we have to iterate on the right side and check if value is not there then we have to add one one other iterate on the left side one get the current value as zero then return true otherwise return Can you mutate the array itself?

[00:54:13]If we if we mark them as negative then this one consider right and this will be ignored now we have to only do recursive part now question how can I can reach will be there since I'm not creating any the main. So what are the element we going to pass a r start it can be plus start Or can we here go to the right started?

[00:55:35]Best of all, why my call exceeded?

[00:55:58]Why my call stock got exceeded, bro?

[00:56:00]What the [ __ ] Is because of this thing.

[00:57:02]I'm assuming since I'm checking for the condition on the top side.

[00:57:28]I'm sorry.

[00:57:38]Okay.

[00:57:58]in college.

[00:58:05]Why people are using Q? Okay, they are using iterative method. I did the requesting method.

[00:58:11]Thanks for this guy. Someone told me to do the same. So I got some idea since after making them as uh negative then I ignored them by sticking this thing and on the left and right side actually it method right.

[00:58:43]First we have to store the first starting value starting the starting index that is zero Q length and if my A current of current less than the same as mine. But but why did you use Q then? Like you did the same thing here.

[00:59:20]But again you would have done with the by marking them as negative and jumping on this many.

[00:59:33]I did compare them equality.

[00:59:45]I was trying to do this some other [ __ ] I was trying to do.

[00:59:57]Are you from college long time?

[01:00:16]I push the pre Hey there.

[01:01:30]Something.

[01:02:01]Some from root till question again.

[01:02:55]Don't The sun.

[01:04:01]tree to leave.

[01:04:17]Someone is going to I try and That's not really not there. Exit and we added a sum.

[01:05:34]We have to sum up all this thing also.

[01:05:39]Let me run this.

[01:06:07]55. Crazy.

[01:06:31]There you are.

[01:06:40]If no return zero Oops.

[01:07:06]Big number.

[01:07:36]27.

[01:07:52]2757.

[01:08:04]If my sun is less than the sun is less than all the sun 22 I don't have to go till end of the row children's We get the value stick.

[01:10:03]without exist.

[01:10:16]negative value.

[01:10:28]Ready?

[01:11:12]There are some Nothing.

[01:11:55]Left or right?

[01:12:01]Sum plus= along with the purple.

[01:12:25]Sum will be zero.

[01:12:31]Sum is getting added.

[01:12:34]Sorry.

[01:12:36]Getting added to some if it's not and if some We see some flag.

[01:13:57]Let us uh check once previous root current sum root is empty false.

[01:14:17]What if I return it will show me undefined?

[01:14:21]If no root then return sum plus equals to this thing.

[01:14:35]If you reach till end of the lead node and check if there is nothing left after that then give some and return to this and pass Nice.

[01:15:24]Oops.

[01:15:36]What's wrong?

[01:15:55]I think it's going to pop.

[01:16:35]Why nothing is printed?

[01:16:38]Console.

[01:16:47]Why is it not even getting Let me check what I did.

[01:17:05]We are returning the flag and we have initialized the flag with checking if the root is not there directly from and my current sum is root.

[01:17:28]I'm checking if my root left is existing or root right is existing. Not any we and path is found some target some is found and found where it is sum. So we return true to I mean we store true and we return from right here.

[01:18:34]Curly braces, bro. What the hell?

[01:18:39]Just because it won't but single it can be written without brace right still getting wrong.

[01:19:04]That's not because of cy braces.

[01:19:13]Did I return something wrong? Right.

[01:19:17]I have to return here.

[01:19:29]Ah [ __ ] If I remove this braces then it will not work. is why it's why why it can't work.

[01:19:41]Technically, it should work. It's because of return thing. So, return is not able to find that.

[01:19:49]It's working, bro. What the [ __ ] bro?

[01:19:55]Then my return was in wrong position.

[01:20:05]Uh I have to return here once we find the flag then we have to return.

[01:20:20]How other people have solved this?

[01:20:24]I use EFS.

[01:20:29]Same solution. Same solution.

[01:20:35]Same solution.

[01:20:41]What the [ __ ] is this?

[01:20:45]Literally did manually everything.

[01:20:49]Did you manually calcate everything since the constraint was smaller even though like it's more than more than solutions?

[01:21:14]I can't even see the code.

[01:21:23]Okay, we have a scroll.

[01:21:27]So what he's doing is like he took the current and root in current. Is he using some prefix some can't use prefix some right?

[01:21:40]What is this doing?

[01:21:44]But I'm not in college.

[01:21:52]Why do you people think like uh if someone is doing le code then they must be in the college?

[01:22:01]I'm not a college student.

[01:22:20]I don't work also.

[01:22:22]I'm currently unemployed.

[01:22:32]I am hunting for HR right now.

[01:22:40]What the [ __ ] you do with those those things, man? Like, come on, man. Ask something that is relevant to this thing.

[01:23:03]So, what the [ __ ] No idea, man. No idea. I'm not pro. I'm not pro.

[01:23:49]I'm just learning DSA right now.

[01:23:52]You're asking the wrong person right now. What the [ __ ] [ __ ] dumb, bro.

[01:23:59]Literally asking the wrong person, bro, bro. It can even It can be even nested, bro. What the [ __ ] left right.

[01:24:31]Yeah.

[01:24:48]Yeah. Uh 1 1804 by is near.

[01:25:49]At least Right. Sorry. Left, left, left, right.

[01:26:28]Okay. You don't want to don't want to try join if you want you can discord we have like 56 people there I don't remember 53 65.

[01:27:17]If you want, you can join.

[01:27:37]What the [ __ ] Oh, by This is my left alone. Left and right 91.

[01:28:20]Watch 48.

[01:28:52]Is it related to the ML and question.

[01:29:08]Easy question.

[01:29:29]So some manage damn.

[01:29:49]Let's Oh [ __ ] I don't Damn boy.

[01:30:36]Crazy, bro.

[01:31:06]be left right there.

[01:31:12]But whenever I come to left, I can right and left.

[01:31:28]Oh, nice.

[01:31:31]2025 24 I think. 26 December.

[01:32:06]pattern. Learning John here.

[01:32:44]Minimum 20 30 downs.

[01:33:17]Bench.

[01:34:04]It's a pattern.

[01:34:18]Which state are you from?

[01:34:25]Uh born in Bihar but currently living in Chennai.

[01:34:47]This link is fast and slow.

[01:35:14]already practically.

[01:35:44]Solve 15 to 20.

[01:36:32]Yes, a decent fundamentals.

[01:36:34]Interesting.

[01:37:00]Almost 120.

[01:37:11]I think 140 14 market.

[01:38:20]Happy evening.

[01:39:35]Thank you.