Dumbest guy doing leetcode live day 35

Añadido: 2026-05-09

[00:43:05]Bro, what the [ __ ] I think you're good.

[00:44:00]Oh [ __ ] bro.

[00:44:03]Still not working.

[00:44:25]Let me explain function is prime or not. nums and simple prime function.

[00:44:33]Minimum jump. Let steps equals to zero is prime false. Current number will be like first number. Since from any index I you may perform one of the following operation old old AI models.

[00:45:03]I used to think like a model work like this like people people might have put some bunch of uh lip there and whenever we send something if it is matching then it will show the output whatever is there element numbers divisible by else.

[00:45:50]Okay.

[00:45:55]We can do plus one, right? So we did current number plus one and which is like last element. We took the last element again and we're doing step++ here. Why are we doing step plus here again?

[00:46:09]Are we doing two double time step?

[00:46:14]Okay, leave that last last item. Uh same thing last item is divisible by this happen.

[00:46:24]Only thing we're doing is current number plus plus one and again we increment the steps. If it steps is there steps otherwise num length minus one. Since here here we don't have any prime number. So you can only go like zero 1 2. So it's just like three length 1 to three. So just three since there is no teleportation is possible. We move through zero 1 2 3 which is like three.

[00:46:54]Zero. Ignore the zero.

[00:46:59]So where did I go wrong?

[00:47:04]Why are we why am I having like two plus >> current number will current number will be like uh + one and last element uh the last element of the array and last item divisible by current number equals to 0 then this should give me the same output I so This one not doing anything else.

[00:47:34]So we only need to fix for this thing.

[00:47:36]Why are we getting like only one?

[00:47:40]Is this is because of the uh no for loop thing?

[00:47:48]I think writing on loop will solve this thing but my conditions can break.

[00:48:41]Where where did I make a mistake, man?

[00:49:57]How dare you?

[00:50:38]Fix.

[00:50:43]You can only replace.

[00:50:46]You can only fix the answer. Not replace.

[00:51:25]Fresh Mario.

[00:52:19]What are you?

[00:52:44]Yeah, check out is all prime.

[00:53:19]Then only you can do uh SC Okay.

[00:55:19]Oh god, what the [ __ ] FN. Oh, FN FN. I have seen FN somewhere.

[00:56:18]FN.

[00:56:24]Where do you use FN?

[00:56:30]FN is short for oh PUB is short from the short form for the public.

[00:56:36]Is it similar to the Java? Is this type?

[00:56:40]What is vector I3?

[00:56:44]What language are you using?

[00:56:58]house. Okay. This is Oh, immutable. Oh, this is similar to JavaScript shadowing.

[00:57:22]You declare the B. Okay, this is similar to the JavaScript.

[00:57:26]Basic data type I32 U32 F64 F32 B car for STR we need to do this thing with the I that is integer 32 byt or what is 32 if it has the same loop for loop it is [ __ ] Crazy.

[00:57:59]What the [ __ ] is this?

[00:58:05]Ownership and borrowing.

[00:58:17]You removed my code.

[00:58:33]But you are not supposed to return true or false, right?

[00:58:37]You are supposed to return the output.

[00:58:49]Chinese. Where is Chinese?

[00:58:51]You want me to convert to Chinese?

[00:58:55]Okay, I got you.

[00:59:26]So the number is not defined. The number is not defined. The number is not defined.

[00:59:51]Num is not defined. Num is not defined.

[00:59:55]You have nums here. You have nums here.

[00:59:57]How can you get numb here?

[01:00:34]I need water. Water.

[01:00:39]Too spicy, man. Too spicy.

[01:00:51]I had so many things today.

[01:00:54]It's going to [ __ ] my strong.

[01:01:05]What is the error?

[01:01:14]Oh, okay.

[01:01:17]You removed the main function what it had.

[01:01:22]Can you copy the hello?

[01:01:33]This was missing. This was missing.

[01:02:02]What am I?

[01:02:26]Oh, where's my code? I don't want to write it again, bro. What the [ __ ] This is wrong. This is wrong. What is this? What is this?

[01:03:01]I need some clothes. I need some clothes.

[01:03:08]Maybe should I just use a for loop?

[01:03:13]If it is prime then we check for last number is divisible by minus one. Then yes++ will happen. Uh uh current number plus one will happen. If not and last element will be like same thing. And if last element is divisible by current element number should I check for current number or like divisible by two only.

[01:03:37]Oh no they're checking for the current element. So current number will be like three. So three it is divisible by three. Yes. So three is divisible. 9 is divisible by three. So it is considered let me let me ask for hint are we going in the right direction first should I do with some different where is my G boy okay they fix the issue I made enter don't give me the [ __ ] answer.

[01:04:23]All right. Your your prime has bug. Why?

[01:04:27]What is nums here? Array or number?

[01:04:33]Oh [ __ ] Where did he put that thing?

[01:04:48]Will this fix my issue?

[01:04:51]Really?

[01:04:53]Okay, that was one of you and a mixing value index. What do you mean?

[01:05:13]nums of one is supposed to give me the nums of one value. Like what the [ __ ] are you saying, bro?

[01:05:19]And uh this is crazy.

[01:05:31]So are you saying like if I current number one it will not change my number itself.

[01:05:49][ __ ] Hey.

[01:06:14]Uh, I need to know VFS, CFS, EFS. I don't know those things. So, I'm sorry.

[01:06:24]Where I use I use all Nah, bro.

[01:07:56]This is not working. I guess that guy was right.

[01:08:02]But I still had to try my best to do thing.

[01:08:11]Pro players have told me already like you can't do without DFS, BFS something.

[01:08:18]This guy, where is he? Where is it?

[01:08:24]See, this guy told uh no no here. Here you can't solve this problem with your code. This problem in DFS and DP.

[01:08:39]I don't have that.

[01:08:42]I feel so bad.

[01:08:46]But how the hell did this two test cases pass?

[01:08:59]All right, I'm back to my back to my normal thing which was the quest since it was we following the path, right?

[01:09:16]Did I complete this thing?

[01:09:35]Here given an integer array target and integer and you have a non empty. You have a non-MP stack with two following operations. post an integer top of the stack and pop removes the integer on the top of the stack and you also have an string of integer n 0 1.

[01:09:57]Use the two stack operations to make number of numbers in stack from bottom equal to target.

[01:10:12]If the stream of integer is not empty, pick the next integer from the stream, push it in top of the stack. If stack is not empty, pop the integer at the top of the stack.

[01:10:24]If at any moment the elements in stack from bottom to top or equal to target, do not read any home stream do not operational.

[01:10:36][ __ ] you can stop operation.

[01:10:44]If there are multiple return any of them so many instructions I have to read again.

[01:10:54]They have given a target array 1 2 3 and n is three.

[01:11:12]Initially stack is empty. The last element is on top of stack.

[01:11:18]A push read one from stream. push it to his app to stream and push it to his integer from the top of the I literally can't understand the question right 80% acceptance simulation simulation got lot The other problem we have Oh [ __ ] So big question.

[01:12:09]Here given an array of strings tokens represents the arithmetic expressions in reverse polish name.

[01:12:24]Post exploitation is in hardware software where expressions return any integer that represents the value of expression.

[01:12:43]Valid operators are plus, minus, star and divide. Each operand.

[01:12:51]Each operant plus was given.

[01:13:08]Okay.

[01:13:10]If plus was given here.

[01:13:19]Each oper may be integer or another expression. Division between two integer always truncates towards zero.

[01:13:27]There will be not any division by zero.

[01:13:31]Input represents the valid arithmetic expressions in regress notation.

[01:13:38]Answer all the intermediate calculation represented by that integer.

[01:14:05]How will you find this thing?

[01:14:16]Consult token.

[01:14:44]And let us write in loop and first thing we need to do iteration and only valid operations.

[01:14:58]Only valid operators are Stop.

[01:15:56]All these operations all the valid operator. Now it's oper may be an integer or another expression.

[01:16:09]Let's console out. Console out.

[01:16:23]Am I really supposed to use stacking here?

[01:16:30]How will you say number push?

[01:17:00][ __ ] According to the board master first priority goes to the package division application addition.

[01:17:28]Here it is.

[01:17:38]First priority should be given to you. We need to do in reverse order.

[01:18:01]What does this polish notation is on brand.

[01:21:04]What the [ __ ] Six.

[01:21:16]How the [ __ ] I shouldn't be able to do easy problem.

[01:22:12]tree.

[01:22:15]All those three things are coming.

[01:22:18]What is I have the remote.

[01:23:28]Shadesh.

[01:24:11]from the left and over XY remove the character left the character left this thing. So it should deleting C and three and remain four C and here we don't have any digit.

[01:26:08]This is start.

[01:26:18]54 we play first.

[01:26:28]Yes.

[01:26:43]Why?

[01:26:47]Why not?

[01:26:50]You could have done the S0ing C4 delet that's the reason B That's probably there's nothing here.

[01:27:44]I hope I hope I Uh oh, I got it. How much did I get?

[01:28:43]What the [ __ ] I didn't do anything, bro.

[01:28:48]What is my total 8.4?

[01:28:54][ __ ] Same as last time.

[01:28:58]Nah, it got decreased.

[01:29:01][ __ ] How much did I get out of 70? I got 53 out of uh 70.

[01:29:14]Oh, in this thing I got so bad.

[01:29:20]Why they have to so many marks for me?

[01:29:24]Everything.

[01:29:43]Okay, got 8. 8.4 CG here. I have I think last time I did better and here I did better. Why the [ __ ] even 16 this mother did everything perfect this is done only one more semester of this let's do this thing to remove the left property Let's set in this. Let us write. Let us write. Let us see. SC first. I'll post this. C 3 4 5 If you this is should be like C and And now still there is save.

[01:31:39]How is this working?

[01:31:55]Remove all the first digit and process Yeah, something else is empty.

[01:32:57]This should at least pass one test case.

[01:33:22]Can't I do this? Let's uh let's uh There we don't have anything Okay.

[01:34:51][ __ ] We don't know.

[01:36:07]Will this work or not? I think this will work for us. Oops.

[01:36:16]Think I made some mistake.

[01:36:20]Wrong.

[01:36:34]data type.

[01:36:41]You don't need to store it at Should it be slash?

[01:37:11]Yes, this is what slash This should work.

[01:37:40]Stop.

[01:38:00]Hey, is not You know, someone CB is Okay.

[01:39:03]Wait.

[01:40:24]This is the last thing.

[01:40:44]Invisible.

[01:41:21]I have some There you go.

[01:42:01]Hello.

[01:42:13]Thank you.

[01:42:26]This operation Thank you. Stand there.

[01:43:44]If I suffer is what am I even sir?

[01:44:30]Okay, this is working.

[01:44:32]Let's return this thing.

[01:44:52]We didn't select something.

[01:45:15]Oh, I want to do this part character.

[01:45:32]I wonder how to do this thing.

[01:46:10]I can't walk that square Oh, this is how we supposed to start.

[01:46:53]What are people n this this thing I use anyone Stop.

[01:47:20]But It's not a number.

[01:48:21]What's up?

[01:48:59]Hey, This one.

[01:49:45]Oh, for tracking we use for reversing we can use stack always check length is greater than position.

[01:50:25]Why was I not two.

[01:52:20]I know.

[01:52:28]I know.

[01:52:38]valid parentheses string empty.

[01:53:02]some history.

[01:53:12]Perfect.

[01:53:40]Hallelujah.

[01:53:49]Amen.

[01:54:01]How do you Watch the light.

[01:54:51]What happened?

[01:55:20]Open it.

[01:55:47]Are they?

[01:56:40]Stop.

[01:56:56]Ready?