Weekly contest 511 | Live Attempt

[00:00:24]Bro, good morning, bro.

[00:00:31]Good morning.

[00:00:37]Let's go.

[00:00:40]Corner starts in 30 seconds.

[00:00:43]Let's go, bro.

[00:00:47]Let's go. Let's go. Yo. Yo, what's up?

[00:00:52]Good luck.

[00:00:57]Good luck, bro.

[00:01:08]Share screen. Yes, sir.

[00:01:20]Okay. Good morning, brother. Morning.

[00:01:22]Let's go.

[00:01:27]Good luck to everybody.

[00:01:31]That's right.

[00:01:50]Starting down.

[00:02:14]What the [ __ ] bro? I've never played chess.

[00:02:23]Even number of moves.

[00:02:28]Four six done and falls.

[00:02:37]Four.

[00:02:52]8 0 1 2 0 1 3 4 5 6 6 How do you do this?

[00:03:06]1 2 1 32 Bring two. Say four.

[00:03:33][ __ ] How do we solve this?

[00:03:37]D2.

[00:03:40]So a knight moves like knight can only do this.

[00:03:55]+ 2 + one. All right.

[00:04:01]+ 2 -1 - 2 + one - 2 - one. Right? These are all the four options.

[00:04:10]So 1 1 0 + 2 + 3 - 1 + 1 + 2 + 1 - 1 + 2 -1 - 2 uh 3 2 4 How 3 2 4 That's + one + 2 + 2 - 1 2 Can knight move everywhere? So up four, five, 66 difference is basically uh uh 2 and 1.

[00:05:31]Three and two.

[00:05:42]Bro, I have no [ __ ] clue how to solve this. I've never played chess. Is it the Manhattan distance? should be the man atom distance should be what I think it has to do something with the man it And here the distance is two. And in here if we see one two if distance and one return false return true bro is it this like I don't even know how do I check true and false how do I how do I check bro how the [ __ ] do I Check 2.5 people have done it.

[00:07:08]I can't even. [ __ ] it. I'm going to submit.

[00:07:15]Oh my god. Thank you, God.

[00:07:19]You're given a the root in a complete binary tree. A node X is called dominant if its value is equal to the maximum value among all nodes in the sub tree rooted at X.

[00:07:32]Okay. Then the maximum I'm complete binary tree.

[00:07:51]Yeah. So this is basically okay. A tree question after so long, bro. Tree question after so long.

[00:08:01]after so so long in solver that's going to take in your tree node star node C node. Okay.

[00:08:37]Now what it does is uh if C node left equals to null and C node right equals to null.

[00:09:03]You just need to see.

[00:09:18]Uh board.

[00:09:31]53 is my water all are dominant. 2 47 are dominant.

[00:09:42]Oh, I've not done three question in years. Holy [ __ ] How name do we have 10 to 5 done uh well I'm trying to figure out do we memorize the trees are just BFS or BFS and you don't memorize DFS BFS you don't memorize >> [snorts] >> unorded map star, uh, Stupid.

[00:11:20]Shut up.

[00:11:23]Where do you [ __ ] stop this alarm, bro? Hug.

[00:11:55]S and uh take question we we don't have to memorize This is what What you do is max left is solver.

[00:12:51]Oh oh oh oh oh oh oh oh oh oh oh oh oh oh oh oh oh oh oh oh oh answer plus it just return the number if c left not equals to null. Uh and min right max equals to end min.

[00:13:23]Uh you can say left max equals to uh max here for c node.

[00:13:33]Why do I have this [ __ ] in here?

[00:14:08]Max here no right and then you can say in answer equals to max between uh left max uh you can say c node value comma max between left max right max uh and then just say hash of C node equals to answer return answer this just tells us the bro how do we solve this trees question I've not done them in like 100 years now you run a DFS and for every node you run a max here is that how you do and now I don't know if this will work.

[00:15:10]end start max root equals to max here uh hash of c equals to how to Make a hash ordered map for three node three node star right. Yeah yes yes yes.

[00:15:58]C not equals to c not yes. Max here of root. Now the answer equals to zero for auto ID of your hash.

[00:16:27]Oh wait, wait, wait, wait, wait.

[00:16:35]equals to int C value equals to C node value. Okay.

[00:16:49]Max value equals to max between C vala max between left max comma right max.

[00:16:59]If Maxwell equals equals to C val you can hash of C node equals to C node.

[00:17:10]If maxwell else if what if is called dominant if it value is equal to the maximum value among all nodes.

[00:17:33]Max, man. Bro, I'm [ __ ] already equals to Okay. C node left.

[00:18:02]This is right max of uh return return.

[00:18:15]You need to return actually.

[00:18:18]Wait, what am I even returning?

[00:18:22]I'm returning the max value.

[00:18:26]Okay, I'm just returning the max value.

[00:18:28]Yes, theta H.

[00:18:44]Well, this question is so easy. But just because I'm I haven't done previous question in 30 years. 4.6 [ __ ] K.

[00:18:55]What?

[00:18:57]What's the error?

[00:19:02]Oh, where is it?

[00:19:11]What solution count do error to make column clean?

[00:19:20]What the what is this saying?

[00:19:31]What is this? Uh default construction is implicitly because this field hash or reference type would not be initialized.

[00:19:43]The [ __ ] is this guy saying? Bro, what if Okay. And you just make it a map here.

[00:20:24]Oh.

[00:20:28]Okay. Five. Five.

[00:20:33]Four. Four.

[00:20:35]Would it actually work though?

[00:20:38]I don't know.

[00:20:45]Uh, not doing not doing trees question in 10 years and I still solved it in my first attempt. Bro, this is what we call I don't know creating the mindset to solve problem because I really hadn't solved T's question in thousand years.

[00:21:02]You're also given a binary string.

[00:21:05]Hold on. also given a binary string and given an array of string strin or array where e has the same length and s consist of characters 01 and can be replaced by the you may perform the following operation. Choose any subsequence sort subsequence in nondereasing order.

[00:21:29]Replace [clears throat] the chosen subsequence in S with the sorted subsequence keeping all characters un names.

[00:21:40]Then return a boolean array where answer I is true. If it's possible to replace all with zero or one and transform is what the [ __ ] Oh my god, bro.

[00:21:57]where answer is true constraints it's just 2,000.

[00:22:02]Okay.

[00:22:07]If it's possible to replace all question mark in that with zero or one and transform into the resulting string using the allowed operation above.

[00:22:23]transform S into the resulting string which is the operation of strings is replacement you can do it individually 101 matches 011 okay and then we can rearrange it The one match 011 sort 101 to get 011 subsequence.

[00:23:11]You're also given a sort replace the chosen subsequence nest with sorted subsequence keeping all other characters unchanged. Okay.

[00:23:23][ __ ] So, there's just too much things happening in this question, bro. Too many things happening in this question.

[00:23:36]But honestly, yeah, DFS. Yes, sir. We did using that.

[00:23:42]Uh, you're given a binding. What is my rank? 6K.

[00:23:47]Five. 5K.

[00:23:49][ __ ] [ __ ] bro.

[00:23:59]Okay.

[00:24:05]So, the first thing is 1 1 0 1, bro. This [ __ ] is so one one false.

[00:24:39]Uh 0 0 0 or 0 1 0 1 0 1 0 0 1 1.

[00:25:02]Wait. So is it false in every [ __ ] case wherein the characters don't match?

[00:25:09]Okay. False 1 0 1 0.

[00:25:17]Select the subsequent 02 of index s.

[00:25:22]Okay. So the point is a you can do that anytime.

[00:25:28]Okay. In fact, just look at these operations as replacing 0 and one.

[00:25:35]Yes, sequence that is all.

[00:25:49]Let's see. 1 1 0 0 1 1 0 is your string.

[00:25:59]1 1 0 1 false 1 0 1 1 0 1 1 0 1 0 1 then it would be okay. So I think the logic to say key it can match is only checking if the intended one versus intended one position is always greater than or equals to current one I think so one moveh I feel like yes if this is your target and this is your current So you can say current uh one index of current should always be less than equals to one index of target.

[00:27:09]Take to this and this works.

[00:27:16]No, you can. 0 1 0 1 0 1 P wait.

[00:27:25]So basically our operation is we can swap any zero with one and yes we can swap zeros and one. That is the operation.

[00:27:35]Swap zeros and ones. Uh [ __ ] Hold on.

[00:27:50]Hold on. This is a target one and target two. Target one and target two.

[00:27:57]Uh uh uh. Is the point I'm trying to make is if string 0 0 1 1 we cannot do any [ __ ] If a string is already sorted that basically means your string is already sorted.

[00:28:31]If it is not wait uh no so I need to figure out a few cases. What what was the 1 1 0 0 1 1 0 0 1 0 1 0 0 1 1 and 0 1 0 1 and basically swap 1.

[00:29:24]Yeah.

[00:29:26]Swap say fair in uh uh uh SK or SK swap. See, bro, just look at the big picture. It doesn't [ __ ] matter. Look at the big picture.

[00:29:49]Uh rather than doing this, what you would want is replacement.

[00:30:17]replacement second should also be I mean it depends one key so you have to fill in left side with zero first 0 second I'm just seeing possible conversion replacement logic is clean now it's just about uh conversion possible let's say Yeah.

[00:30:48]Uh we have 0 0 and 1 one I think is it never False.

[00:31:18]I can't figure out a false case, bro. I guess I need to do a wrong wrong answer submission and then just get to know 1101.

[00:31:32]False case is false 0 1 0.

[00:31:38]So false case I guess is just when your frequency don't match or false case or if your S is already sorted you can't do anything 0 0 1 One one can swap zero and one.

[00:32:30]You can swap zero with one.

[00:32:46]zero.

[00:32:51]Hold on.

[00:32:53]Oh, wait. This [ __ ] can never be built until and unless zero. Okay bro, come on. Okay, if you look at it, the observation is zero left.

[00:33:09]That's all.

[00:33:10]That is all you can do [cough and clears throat] from your original string left shift wherever there is a one.

[00:33:24]Okay.

[00:33:27]Mhm.

[00:33:34]Okay. So, we figured it out. We figured it out. We figured it out.

[00:33:41]Uh at least zero and everything's frequency should matching. Okay, I think the logic is fine. Now, we might just have this question solved.

[00:33:58]uh int matcher dual matcher sorry which takes in your ve uh string s string t. Now what is the length of your 2,00 and N. Where is N?

[00:34:37]RC C of your Z C [cough] [laughter] and I = to S. than -1 I is greater than equals to 0 I - 0 in S 0 in T = 0 logic T. So if first of all if s 0 if s i equals = to zero to 0 in s+ if if t i equals to equals to z in t + if any case 0 in t is greater than 0 in sce source. So then you return to take. So the matching logic should be I think so this is just the entire logic.

[00:35:52]Now what you do is replacement me you always put target me the left most you have to match the frequency or left most no I think we solved it that's all.

[00:36:06]That's all. Uh first you have to do the replacement.

[00:36:16]Uh int zero frequency = to 0.

[00:36:22]So one frequency equals to 0 for car C of your S. If C = to 0 frequency + L1 frequency plus. Now what you do is for string s of your strs in current 0 frequency equals to 0.

[00:36:56]Current one frequency equals to current one frequency equals to zero. Uh now what you do is for car C of your S if the C equals not S str if C= to0 then current 0 frequency ++ current one frequency class [cough] fill in. So what you do is now string temp equals to str.

[00:37:46]What you do is for car again car C of your STR if C equals equals to question mark and uh C 0 frequency is greater than zero zero frequency But uh uh uh uh not your SDR temp frequency is less than zero frequency cannot be equal.

[00:38:45]H do cannot be fair [snorts] [cough] bro I'm doing current zero frequency less than zero frequency trade shouldn't be too much shouldn't Too much. How many people will solve this? 4K people already must have solved this 1,000. Not much, bro.

[00:39:23]Current zero frequency is less than zero frequency to get temp I = to uh zero.

[00:39:34]Else temp I = 1. Right.

[00:39:45]extra zeros.

[00:39:49]Just apply a check here, bro.

[00:39:55]I think this should be fine.

[00:40:08]If what was the case, bro?

[00:40:13][laughter] Vector ba.

[00:40:23]Vector bool. Answer.

[00:40:28]There are case. If uh CZF F is greater than CF or C1 F is greater than uh C1 CO I mean zero frequency one frequency C1 F is greater than one frequency then you return uh then you do instead Push answer push back answer push back false continue. Okay.

[00:41:07]Continue.

[00:41:14]Correct. Correct. Correct.

[00:41:18]Correct.

[00:41:25]Equal he.

[00:41:30]Now you just have to do bool check equals to uh matcher matcher between your uh uh uh uh s comma m if check in fact just do a r answer it is a r sorry error error dot push Push push back your check. That's all.

[00:42:05]That's all. Return error.

[00:42:11]At least let it compile.

[00:42:15]Where's the issue?

[00:42:30]ZF ZF uh one frequency. Yes.

[00:42:39]Temp of I Oh my god, bro. and I = to0 I less than temp dot length [laughter] I ++ and you just say car C equals to tempo file true true false so true true false that is working true false true is working and true is working.

[00:43:19]Should I submit it? I think yes.

[00:43:41]Yo, bro. I think this should work.

[00:43:45]True. True. False. True. I actually don't care. Let me just submit it.

[00:43:51][screaming] True and false.

[00:44:00]How the [ __ ] did my matcher return here?

[00:44:05]My matcher should have returned a [ __ ] Yo, this is a Wait, how does this make sense? How does this make sense? My matcher should have returned false here, bro.

[00:44:24]see out s.

[00:44:31]How does this make sense? This is unexpected.

[00:44:35]Uh S is 01 to go 111 Q.

[00:44:48]Wait. So my this logic is incorrect. A I'm not handling in here probably.

[00:45:14]Oh my [ __ ] dumbass.

[00:45:28]Bro, I didn't [ __ ] [clears throat] correct now. True, true, false.

[00:45:54]Wait, hold on.

[00:45:59]True, true, false, true, false, true, [clears throat] true.

[00:46:06]And your fourth one false, which is it is correct. And we don't want to see out any of this. Submit this.

[00:46:23]Good day.

[00:46:27]>> Good day, bro. In fact, I could have solved it in my first [ __ ] attempt. I did a very stupid mistake. There was no error in my logic. No error in my logic, bro. Good day, bro. Good day. We like days like these. We like days like these, bro.

[00:46:43]What about you, Y? It's tough.

[00:46:47]Is it? Is it tough, bro? We just did it, bro. Are you guys talking about the fourth question already?

[00:46:55]Again, I'm giving up lead code. I'm not made for this [ __ ] I hate this [ __ ] lead code, brother.

[00:47:00]Brother, there might be some ups and downs, but we can't quit lead code, bro. God has put us on this earth for a reason, and that reason is to grind lead code. Let me be honest with you. The only reason we exist on this planet is to grind lead code. We can't quit, bro. We can't quit.

[00:47:19]We can't quit, bro. The only reason for our existence is to grind lead code.

[00:47:25]Let me be honest with you. You shall not quit. Approach Katy third sa I can't tell during a life contest brother. What are you talking about? I can't tell during a life contest.

[00:47:39][ __ ] man. This is what we like, bro. 2K rank after what? Thousand years.

[00:47:47]This is what we like. And I could have avoided that penalty. I am stupid, man. [ __ ] bro. This is what we like, bro. Is Is this a lead could be smooth time? Nah, that's too much. That's only for all kills.

[00:48:04]They find a transformation.

[00:48:10]What's all dudes after solving third lama giving life motivation and [ __ ] bro? Bro, no it doesn't. Listen, listen, bro.

[00:48:21]Brain humor 9121. I You can literally see I've lost my night badge, bro. I actually don't care if it's a rating gain or loss, bro. But we got to keep grinding lead gold. That is something that's persistence in your persistent in your life. Doesn't matter if you're gaining rating or not. Praan exactly given an array of string. Do we define a transformation on the string s as follows at even uh independently cycly shift e and zero by any number of positions to right possibly zero to right reconstruct string by two strings are equivalent if one can be transformed into another by a single transformation. Partition words into minimum number of groups such that if one trans can be partition words into minimum such that every string belongs to exactly one group. Every pair of strings in the same group are equivalent.

[00:49:31]Return an integer denoting the minimum number of groups. [ __ ] What are you talking bro? What are you talking [cough] Z and G?

[00:49:49]Okay. Therefore, both strings are equivalent and belong to same group.

[00:49:55]Okay. A, B, C, C, A, and B. What is the length here? It's [ __ ] 10 to 5, brother. 10 to 5.

[00:50:05]I think what we can do is sorting odd indices even indices if they are equal.

[00:50:13]No, it doesn't make s To find the cycle there was a very beautiful way words.length length the sum of words I do not exceed chat even this might be a bit too much bro there might be at least did he do third [laughter] you guys don't believe I can solve third or what the [ __ ] do you mean bro why do you keep a mustache I don't like do you think this is a mustache I did third bro hello hello brother I'm beginner and need code currently solving uh solving problem every day but before going to graph df FS and BFS I have to learn recursion but memory but K4 away bro recursion is literally the most intuitive concept ever bro I mean if you learn recursion bro you you're going to unlock so many things in lead code if you learn recursion recursion recursion is so important brother grind your ass you need to learn it ntj is ng zw W and G NG Z or Z NG matches group.

[00:51:51]The point is [snorts] how do you so the question translates into strings and you need to see if they are a rotation of another string.

[00:52:07]A B C D A B C D Now B C D A is a rotation left right independently cycle shift E and zero by any number of positions to the right. Oh to the right.

[00:52:27]Huh? B C D A B C uh D A Huh to the right. Okay. So, O of N. O of N. Bro, this [ __ ] might be But we'll get a [ __ ] D if I do that way.

[00:52:51]Words length 10 to 5 [clears throat] 10 to 5 into 10. Nah, bro.

[00:52:59]How the hell do I How the hell do I get rid of a T here?

[00:53:08]What the [ __ ] They have given such big constraints, bro.

[00:53:13]How do I get rid of TL here?

[00:53:17]10 to five. What?

[00:53:21]We can't be constructing the substrings.

[00:53:29]Let's say if we had A B C D E is sorting a method to check A B C D E F and B or E merge E or B or C D A F. See now this is you can try rotating it as many times as you want but it would never work.

[00:53:51]Sort sorting is not a reliable method.

[00:53:56]Sorting is not a reliable method. There there used to used to be a way check if string is check if string is rotation of another delete code. There was a question like this. Rotate string.

[00:54:16]There was a question like this already, bro. I've done [ __ ] brute force here.

[00:54:27]I've literally Oh my god, bro. If I would have done a good uh approach here, I would have reused my approach. But now looking at my code in here, bro, chat, look at how I have solved this this question. This is useless. I've literally [ __ ] erased characters and added it to the front.

[00:54:47]Stupid.

[00:54:49]So, this code will not help me. I wanted to see if I had some logic to check rotations. It's all about checking rotations.

[00:54:59]How the [clears throat] [ __ ] do we find rotations? L explain the third approach after the contest ends. Brother, you can still solve it. You just need to figure out some observations. It's all about finding out observations. There's no coding involved.

[00:55:12]Why? Third prefix for S and suffix for S. String. I didn't use that.

[00:55:18]Third was actually a nice question. Had fun solving it. See, this is how Yo Kavish, where have you been, but this is how people like to flex like he won't just directly say I solve third. Look at how he's framing it. Third was a nice question. Had fun solving it, brother.

[00:55:32]We know you solve third.

[00:55:38]hashing guys.

[00:55:41]I don't know. I got gray by third. You can't solve it, bro.

[00:55:48]I'm just trying to I'm I'm angry about my penalty on third, bro. I didn't deserve that penalty. I just wrote a if conditional if condition.

[00:55:57]Never mind, bro. In here the sum of words i length do not exceed sum of words i.tlength.

[00:56:21]Oh, hold on.

[00:56:27]Aa the sum of words i.length.

[00:56:30]Oh. Oh.

[00:56:32][ __ ] This is stupid. sum 5 into 10. So we can follow our approach. The question becomes optimally check if a string is a rotation of another. If a string is a rotation of another, how the [ __ ] do I check that?

[00:56:50]How do we check that? Oh, how do we check that if a string is a rotation of another?

[00:57:01]C D E F Bro I don't know how do we check this Okay. I think ABCD. What we can do is we can shift that by right. Right. Yes. A B C D here.

[00:57:53]What if we had D C B A?

[00:57:57]So D A B C.

[00:58:04]So that is incorrect, bro. That's incorrect.

[00:58:09]That is incorrect.

[00:58:11][ __ ] bro.

[00:58:14][ __ ] Bro, I just need to figure out an optimal way to check if strings are rotation of each other, bro.

[00:58:24]Damn it.

[00:58:27]What is it? Make a function for rotation. Yeah.

[00:58:31]Come on, bros.

[00:58:36]Brah, hold on.

[00:58:42]Any advice for 2020 year old unemployed depressed CSgrad? Brother, life is too big. You don't have to be depressed about it. Let me be honest. Life is too big. You don't have to be depressed about it.

[00:58:59]We can't Why can't I think of it? I feel like I did read about it. Optimal way to check if strings are rotation. We can't just [ __ ] BCBA.

[00:59:26]>> [cough] >> Yellow A.

[00:59:45]But still A B C D right shift D A B C uh C start D A B C You can start at any index.

[01:00:09]You can start at any index. And bro, if I knew this, I could I think I can solve this. But how?

[01:00:19]How, brother? How? How?

[01:00:23]Social media, bro.

[01:00:27]What the [ __ ] are these news? What the [ __ ] are these videos?

[01:00:31]That basically means dab.

[01:00:35]I might just be cooked, bro.

[01:00:39]Cycling shift while someone I will suggest make a new chat and give GP a prom to prepare for. Yeah, bro. Yeah. All right, gang. Am I out? S equals to S + S is the hint, bro. You solve the fourth question, bro. Got mocked yesterday. Shut up, bro. Shut up.

[01:01:00]I didn't get mogged, did I? I don't even remember.

[01:01:06]I don't even remember.

[01:01:10]Feeling like a left, bro.

[01:01:24]D C B A. Now try to find ABCD in there.

[01:01:28]You can't because there exists none.

[01:01:31]There exists none.

[01:01:38]So the question translate into find a substring if it did not match. You'll have to [ __ ] A B C A A A A A A A A A A A A A A A A A A A A A A A A D A A A A A A A A A A A A A A A A A A A A A?

[01:02:10]Can you do that again?

[01:02:16]How do you still do it, bro? This question is crazy. I'm still getting I'm What is your rank? 2.8K, 8k maybe minus 2.9 I am literally 3,000 bro kavish bro did you get a penalty I got one penalty and that is what [ __ ] [ __ ] me up bro [cough and clears throat] solve the question first the [ __ ] you mean bro I'm trying I'm trying I can't let me turn off the trying bro. We can't ad ba.

[01:03:16]So the question now translate into find string find if your current string has this substring. Okay which find substring in string in CPP do you have any inbuilt method?

[01:03:44]Hold on.

[01:03:50]Wait. So there is an inbuilt method.

[01:03:52]Find target string and pause.

[01:04:03]I think let's just use that inbuilt function, bro. Let's use this inbuilt function.

[01:04:08]I I don't know. Let me at least try coding something.

[01:04:15]Bool is cyclic that takes in your string s and string string substring up to string s uh what what is this size t dot found size t Found this is basically s.tfind s.find substring right that is that is text.pfind point. Yes.

[01:04:54]If found is not equals to uh str boss return false return true return false. Okay.

[01:05:16]Okay. This just checks cyclic. Now for birds.

[01:05:23]Wait, the point is you also have to turn it far.

[01:05:35]Every pair of strings in the same group are equivalent. Return an integer denoting the min number of Okay.

[01:05:57]Want to be your vacuum cleaner.

[01:06:02]Brea in your dirt if you like.

[01:06:09]Hold on.

[01:06:12]Every group should be identified by its string or every string.

[01:06:26]Okay. Okay.

[01:06:30]Okay.

[01:06:32]vector of vector of int that is vector of vector of actually string.

[01:06:41]Uh uh uh uh uh uh uh uh error and hash of odd substring unording.

[01:07:11]So that you don't have to calculate [ __ ] again and again.

[01:07:17]Even substring even substring. Okay.

[01:07:31]Okay.

[01:07:33]Calculate and store substring uh uh string find.

[01:07:43]We don't want any over uh Doro should be cyclic, right? Yes, doro should be cyclic. B vector of string.

[01:08:17]Find substring. It's going to return return odd substring and even substring string odd substring even substring for i = to bro take a [ __ ] string and input string and s i = to0 i less than s.length length I ++ if I and one odd sub string plus equals to S of I else uh S of I in the end you return your odd substring even substring.

[01:09:08]This does not we actually don't need their child. We actually need a vector of string.

[01:09:31]Error dot push error dot push back uh uh uh uh error dot push back words zero uh vector of string auto temp equals to uh find bro at least don't do typos find bro this is going to give a t this is Not that easy.

[01:10:04]Words zero.

[01:10:08]Now you can say odd substring of words 0 equals to temp 0 and temp 1.

[01:10:26]Yes.

[01:10:28]for end I = to 1 I'm typing query now print I= to 1 I less than your words dot length I ++ [clears throat] I ++ if uh uh Check existing uh words say check or string s of error.

[01:11:18]Take care.

[01:11:28]This checks equivalent.

[01:11:42][ __ ] It takes in your two strings, right?

[01:12:09]String and S1, string and S_sub_2 strings key or even substring odd or even substring and even subring What the [ __ ] Hold on. Am I complicating it? How many people sold it? 1.5K.

[01:13:03]2K.

[01:13:10]Aa the question was check current key OSS is rotation of target key oss.

[01:13:24]Same for current ESS. Target ESS.

[01:13:32]If yes then good.

[01:13:35]If no then scroll ++ after checking for all. Click here current and target. In fact, yes current and target plus equals to tar dot find is cyclic.

[01:14:33]Find substring returns even substring odd substring and equivalent.

[01:14:40]Find ESS OSS of S1 and S2 and then check cyclicity. Then check cyclicity.

[01:15:13]I think hashing hashing function.

[01:15:24]That makes your code so much cleaner.

[01:15:27]Function substring may give us two unordered maps.

[01:15:37]that does the hashing for us.

[01:15:53]If sub of s comma even sub of s in the end you can say r sub of s equals to oss is even sub= to ESS.

[01:16:22]Yes. Hashing if hash.find s1 is not equals to hash.

[01:16:34]Then you can say string s1 oss sub s2 oss s1 ess1 oss s1 oss equals to uh not odd sub equals to odd sub of your S1.

[01:17:08]S1 ESS equals to even sub of your S2.

[01:17:22]Yes.

[01:17:37]Find find sub for your S1 S1, [ __ ] I let Let me just declare them globally, bro.

[01:17:55]Let me just declare them globally here.

[01:18:18]Find subring s_ub_2 s1 oss equals to s1 sub key z just kill me bro. What the [ __ ] bro?

[01:18:40]What am I doing? Just the b in 15 minutes.

[01:18:46]Kish, you did fourth, bro.

[01:18:49]Kavish, you did fourth.

[01:18:51]Yeah, you you get stuck if you think a lot.

[01:18:55]Kish, brother, you did fourth. Boris, bro. If you have played chess before, you know that a knight can move from one cell to another with correct moves. I didn't know that, bro. So, Mr. Minoxidil third stream of this week. Yes, sir.

[01:19:08]Bro. Yes, sir. First of all, stop calling me Mr. Minoxidil, bro. What do you mean, Ravish? Bro, you did fourth, bro. I'm jealous.

[01:19:28]ESS equals to this.

[01:19:36]Hell no, bro.

[01:19:40]Bro, bro, did an all kill. That's insane.

[01:19:44]S1 ESS is S1 sub key zero. S2 ESS is S S1 OSS is always zero and S1 ESS is S1 sub 1. S2 ESS is S_UB_2 sub 1 up. Now b check one equals to is cyclic is cyclic current and target s1 oss, s2 oss.

[01:20:33]If is not check one return false check two equals to is cyclic S1 ESS S2 ESS return check one and check two and and check one true.

[01:21:01]Okay.

[01:21:03]For string s in er r match false.

[01:21:21]If pool equals to eq ui eq ui your string and your your [ __ ] words i.

[01:21:43]If is same then you can say matched equals to true and break.

[01:21:52]If matched true.

[01:21:56]So then you continue match true.

[01:22:00]What you dot word of I words of I sorry and in the end return error dot size no target plus equals to t what undeclared identifier str. Did you mean std?

[01:22:44]How do we use how do we use this not equals to n std st?

[01:23:05]Oh, string. Sorry, sorry, sorry.

[01:23:12]It's actually string right. What is the name space? The name space is string.

[01:23:17]It's called namespace, right?

[01:23:22]Is not equals to words. Len.

[01:23:31]Oh, chill.

[01:23:39]is a so many compilation errors, bro.

[01:23:45]I I write so bad code, bro.

[01:23:55]1 3 5 Let's just submit it. We're going to get a TLE. I know. Let's just submit it.

[01:24:04]We're going to get a TLE.

[01:24:06]because it IS VERY UNOPTIMIZED.

[01:24:09][screaming] Shut up. I know that. Shut up. Wrong answer.

[01:24:14]Wrong [ __ ] answer.

[01:24:17]Yo or yo.

[01:24:20]Output is four. Expected five. So, hold on. I didn't get a TLE. I got a wrong answer. What?

[01:24:35]>> [clears throat] >> See how matched s there are uh words I match.

[01:24:51]No, it matched. Why are you go? Are you [ __ ] stupid?

[01:25:06]If S1 not equals to S2 length turn false.

[01:25:23]What?

[01:25:24]Oh, easily climbing.

[01:25:27]Hold on, bro.

[01:25:32]We're just five and we're not matching anything.

[01:25:37]Let's get Let give me my TLE, bro. Give me my TLE.

[01:25:47][screaming] [ __ ] knew it, bro. 692.

[01:25:52]6, bro. 692 by Oh my [ __ ] god. One test case away. One test case away. Is there anything I can do to optimize this, bro?

[01:26:10]Any [ __ ] thing I can do to optimize this?

[01:26:15]Oh my god, bro.

[01:26:20][ __ ] [ __ ] bro. Anything I can do to optimize this?

[01:26:34]No, brother.

[01:26:39]Anything. Just any [ __ ] Please tell them. Please tell them I [ __ ] hard. You dumb asses at lead code. You don't show test cases, bro.

[01:26:56]These [ __ ] Oh my [ __ ] I can't see any way to optimize this, bro.

[01:27:11]Equivalent maybe early return.

[01:27:19]I'm checking if that word is same to any of the same [ __ ] bro. So, you're telling me I'm getting What the hell, bro? First question, bro. It's just Manhattan distance, bro. You only said why hide solutions. What the [ __ ] are you talking about, bro?

[01:27:44]N to five solution.

[01:27:47]Bro, you're becoming Mikuel Tal from MB.

[01:27:50]Save your Who the hell is Mikuel Tal?

[01:28:04]Bro, what the [ __ ] is this hairline, bro?

[01:28:14]Damn, look at where what his hair were one time began to succeed in this happy birthday.

[01:28:23]Where is he? Is he in? No, but he's But he's a genius, bro. He's a genius. Latian Soviet chess grandmaster.

[01:28:34]Bro, I'm getting [ __ ] off. And I do not look like him.

[01:28:38]What are you talking about? I wish I was as smart as him. And he doesn't look bad. It's just that his hair is bro was getting distracted from there and might just get all killed. Bro, I can't see any way to optimize this optimize.

[01:28:56][ __ ] one single test caseimize.

[01:29:13]Huh?

[01:29:16]Break early.

[01:29:33][ __ ] I don't know how to optimize this.

[01:29:37]There's just no scope for optimization.

[01:29:39]I'm maybe there's another approach so that I can't change my entire approach.

[01:29:44]I don't have any other approach. But optimization, no optimization, bro. 692 by 693. Wow. Wow.

[01:29:54]Wow.

[01:29:58]Wow.

[01:30:15]current or target.

[01:30:23]I don't know, bro.

[01:30:25]Let me just submit it again.

[01:30:35]>> [screaming] >> [ __ ] [ __ ] Bro, I think that's Wow. This is going to be one of 2.60 people sold it, bro.

[01:30:52]One of the saddest contest, bro. 692 by 693.

[01:30:58][ __ ] Life is just so bad. What do I even say?

[01:31:20]One single test case stopped me from getting my all kill. A single test case stopped me from getting my all kill.

[01:31:27]Third is just handling zeros. Exactly.

[01:31:34]What was the second question?

[01:31:38]First was just Manhattan distance.

[01:31:40]Third.

[01:31:42]Okay. The third. Why did third? But after you said observation is important.

[01:31:47]Yes. The third was just an observation based question. You just had to figure out a few observations. And then the first observation was false target string or source string 0 key or one key frequency match frequency match. to directly false.

[01:32:17]Let's say target string which has which has some these question marks in there one frequency source string one frequency zero one frequency of target is greater than one frequency of source to false.

[01:32:34]Similarly for zero frequency of target is greater than zero frequency of of source to be false.

[01:32:42]What you have to do is frequent add left to the very zero one add possible depends on your zero frequency target. This was the logic for replacement. Besides that now how do you check if the string can be converted brother this choose any subsequence sort in this whatever whatever we don't care what it basically means is sort and it's only a binary string so that means zero can and one can be uh zero or one go up interchange And that also basically means your string at max left.

[01:33:50]That's all you can do. That is your this entire [ __ ] This entire [ __ ] means left depends on how many you how many ones you have on its left.

[01:34:07]So that was the logic bro matcher. This was the logic that just tells you zero in target greater than zero in what that means is if your target was let's say if your target was uh 0 1 0 0 okay and source was source was uh 0 0 0 1 source was 01atch it still remains 0 right at any moment t so you simply return False. You simply return false. This is assuming key. This comes after assuming not after assuming.

[01:35:15]After checking key, S or T key, zero frequency or one frequency is same. This was the logic. Now, this was the logic.

[01:35:24]Let me show you another working example.

[01:35:26]Mano, if your S is 0 1 0 0 S target is target is uh 0 0 0 1 uh in fact this is also false. This is also false. Basically matchically you have to move here. But can you ever move that?

[01:35:59]No. Because it's just binary.

[01:36:06]Why would this return false?

[01:36:18]So you return false. This was my logic.

[01:36:21]Good or bad?

[01:36:23]Question three is maintaining a prefix containing one's count up to a certain position. I just did I just maintained zero count bro good no same approach bro I got to this after many attempts it's crazy you thought this at first only nah brother this was an ob mean yeah come on okay brother the cheaters are I'm damn sure see it's an algo called boo algo and these guys just wasted why are you guys surprised bro you just have to get the sorting part rest is easy exactly exactly the replacement logic that zero frequency and one frequency match and If there's an option, always add zeros on the very left of your target source match. Zeros at the left is the optimal case. That's all. That's all bro. That's all. And another observation was subsequence and sorting and all that.

[01:37:15]That simply means left. That's all. Read my two upper comments. What is upsolving in contest?

[01:37:23]Where are upsolving? Basically means uh the questions you couldn't solve in contest, solving them after contest and learning learning the trick. Plans for today. I might be going out with my family for lunch. Uh besides that, I don't really have I'll go out for a run.

[01:37:40]Yo, good good reminder, brother.

[01:37:42]Whosoever that was, it's time to check track my.com. For those of you who don't know, this is a new project that we have built wherein we basically log in each and every day. Bro, if you if you don't document your grind, you're stupid. I am logging my each and every day in here.

[01:38:02]Let's see if anybody else has started logging.

[01:38:06]Okay. So, we have Pudish is me. Pudish is me. Adita BHD99 AB33.

[01:38:15]And I told you that if you're logging here consistently, I would be reviewing your profiles. Let me show you first mine, right? So yes, and also the fact that right now I have added an option to add track your metrics like bed time or Instagram, but I feel like that is very hardcoded. I want users to give them their own metrics whatever they want to track, right? So we I'll be adding an option to add custom metrics so that people can add whatever metric they want to track their bedtime Instagram time or even their daily goon count whatever bro whatever. So yeah, I'll be changing that. Right now, I'm just track I've just hardcoded two metrics as bedtime and Instagram screen time. And if if I look at my week, oh, I've not logged in. I've not logged in, bro. But you can see my week has been pretty okay.

[01:39:08]Eight out of 10. And my this is my entry for the day. Entry for the day. Let me just log in, right? Let me just log in.

[01:39:18]Let me just [ __ ] log in.

[01:39:24]Yeah, let's look at my month, bro. My month has been going pretty The last week has been pretty okay, bro.

[01:39:33]It's It's a bit green. I even had a [ __ ] eight out of 10. And hold on.

[01:39:39]Last week, I also cleared my probation.

[01:39:41]So, it was a 6 out of 10 day, right?

[01:39:43]Finally cleared my probation. Whatever.

[01:39:45]Whatever. So, you get the gist of it.

[01:39:47]Let's look at the other people who are tracking it, bro.

[01:39:53]So, we got some guy named Sh. This is Shaitan. And also, if you don't want me to check your profile, just make it public. Just make it public.

[01:40:03]More scroll one left. Don't Don't chase random [ __ ] in Metro, bro. Drops random [ __ ] What?

[01:40:11]What? But what is my bro saying? Can I add all my time?

[01:40:17]We can have a goon counter in it too.

[01:40:19]Yeah, bro. I mean, if you I'll just add an option to add custom metrics. Now, if if it it's up to you if you want to track your goon count or not.

[01:40:26]Can I add all my time starting 11 in there? No, it's just a daily short log.

[01:40:32]It's not to write huge ass journals.

[01:40:34]There's a text limit. There's a text limit. Let's see what Shatan has been [ __ ] doing. Bro, this guy slept at 3:50 a.m. Is he stupid? That's why he didn't give contest today, bro. 30 minutes Instagram screen time. That's not bad. But he slept at 3:50 a.m. Is he [ __ ] stupid? What time did I sleep last night, bro? I slept at I slept at 2:45. Bro, I'm not as bad as Shatan. Bro, on July 15th, I slept at 5:45 a.m. and I had office tomorrow. If you want to read why did I sleep so late, check out Track My Life, bro.

[01:41:07]Track my life. Solve one DSA question.

[01:41:10]Easy. Did some C programming one could hard problem and also wasted a lot of time. Congrats bro, you're wasting a lot of time. Congrats. So, this was Shatan Aditya, BHD99.

[01:41:23]Let's look at my bros entries.

[01:41:27]Today I saw three question of bi-weekly.

[01:41:29]Congratulations. Also completed one section of e-commerce product.

[01:41:33]Congratulations. Good day. Seven on 10.

[01:41:37]Why I can't why I can save entry for future. Can there be an option where we can choose what habits we want to track in particular not just in bed by time?

[01:41:45]Oh yeah. See, that's the same thing I'm talking about. BHD, bro. Sure. I'll keep that in mind. Hold on. What is this guy doing?

[01:41:55][ __ ] eight out of 10 day. B12 D2.

[01:41:59]Dude, what the [ __ ] is this? This is some code language.

[01:42:04]AJ 31003. Bro, I don't know, but I'm happy you had a good day.

[01:42:10]This guy had a 1 hour 30 minutes of screen time. Okay, coming to AB33. Slept at 2:00 a.m. Let's look at daily log. 7 out of 10. Decent day. Tetness injection. What happened to you? Doctor said she will admit me if my sorasis flared again.

[01:42:29]Soriasis. What is that?

[01:42:34]It is acne.

[01:42:37]Damn. Wow. I hope you you get well fine soon, bro.

[01:42:44]Maintaining my CF lead question. Let's go. Early sleep because of morning contest. What time did he sleep? This [ __ ] slept at 2:00 a.m. and then calling it early sleep. Absolute [ __ ] liar. Absolute [ __ ] liar.

[01:42:58]I was at 4. Nah, bro. I did not know.

[01:43:02]That looked like multivitamins.

[01:43:04]Might be, bro. Might be. Might be. Fab counter. Chill, bro. Chill. Show the code of third question. You want to see the code for third question? How do you speak so illquent English?

[01:43:19]You think my English is iloquent?

[01:43:23]I don't know, bro. Probably watched a lot of English content.

[01:43:27]Bro, this is my code for third. Who?

[01:43:29]Whoever was asking it, pause and look at it. Pause and look at it. This was my code for third.

[01:43:36]Ro spent 40 minutes on first question, 30 minutes on another two.

[01:43:41]Damn. First question was just Manhattan distance. Even I've never played chess, but Ethan first question should would always be easy. So, I just did the Manhattan distance. Bro, are you on Twitter? Yes, but I don't post anything, bro.

[01:43:56]I've been watching you since last year and you've made a good progress in English as well as solving problems.

[01:44:00]Rohan Gaming Tech1826. Thank you, brother. We appreciate them, bro.

[01:44:05]Appreciate that. Thank you.

[01:44:08]Bro, your lead code ID ID is Pist G. Pist G. I don't think first is easy. Yeah, it was not easy.

[01:44:20]Minus 10. Hold on. I didn't see my rank, bro. I didn't see my rank.

[01:44:27]3.7.

[01:44:29][ __ ] Let's check entrance.

[01:44:36]This weekly is 511 with this G.

[01:44:46]Finally, bro. A plus 16. Although I'm still not in 1800s, bro. I'm still not in 1800s.

[01:44:56]8 minute. Why is it taking 4,000 rank?

[01:44:59]I'm 3.7K.

[01:45:01]So I might just be I might just get plus 17 plus 18. We're very close to back to 1,800. Bro, yes sir. Do you think we can get back a night badge, bro? Do you think we can?

[01:45:15]How important is recursion? I'm stuck at it. There's no DSA without recursion, bro. First was easy to be honest. I spent time on recursion, but then done with Q. What?

[01:45:27]Look at how I did first. What the [ __ ] are you guys doing, bro?

[01:45:32]This is how I did first, bro.

[01:45:35]This is how I did first. Why is it not?

[01:45:40]Why is it not? It was just Manhattan distance. Manhattan distance to return false return true. I just saw this from the test cases.

[01:45:51]Manhattan distance is even false. That's all, bro.

[01:46:01]You guys are genius. First game made me to [ __ ] Nah, bro. It's nothing about being genius. Trust me, I'm dumb as [ __ ] Solve threesome now without going for solution. Oh my god.

[01:46:12]I threesome. Damn. That that wording is crazy. Threesome. Wow.

[01:46:20]Will I ever get a three?

[01:46:22]Shut up, bro. Add the baddy chat time.

[01:46:27]Battery chat time in in track my life.

[01:46:30]Track my life. Track bro.

[01:46:34]Start.

[01:46:38]Uh. Yeah. Let me just spin it. Bro, explain. Third heist, bro. I've already explained it. I've already explained it, bro. I have already explained it.

[01:46:49]Crack my life. Bin message. Bro, I'mma add a goon counter for this week. I need to add a boom counter for this week.

[01:46:57]Hold on. Okay. Another another thing I wanted to tell you. This feature is not very visible. I'll increase the visibility is you can add weekly priorities besides your daily at this.

[01:47:08]See, today marks the start of this new week, right? What do I want to [ __ ] achieve in this week? I add in the weekly priority. So now when for this entire week, that priority would be active. And now at the end uh every time I'm filling in a daily log, I'll have to answer how did your weekly priority go just so that you stay focused. So this week's priority I would say I want to learn sweep line sweep.

[01:47:37]And what else should I learn? Golang, bro. In fact, just do Golang. A little bit of Golang. A little bit of Golang.

[01:47:43]This is my this week's priority. Okay.

[01:47:45]Golang. Now whenever I'm filling in whenever I'm filling in my daily entry you can see I need to add an update on Golang you're forced to write your progress and when you don't do anything you are forced to write I didn't do anything and that makes you feel sad from inside let's see how does my weekly priority go next week we'll see how did my current week go bro hey mate can you show me how you check that rank estimator masumali 4144 four.

[01:48:16]You just got to go to Entrant Hub.

[01:48:18]Entrant Hub.

[01:48:21]Entrant Hub. Bro, we have a Discord, too, right? Is there any DSA baddies there on your server? Got to need some motivation to keep up with this [ __ ] Bro, this guy desperately needs a goon counter on his track. My life, this guy desperately needs a goon counter, bro.

[01:48:40]He wants [ __ ] baddies, bro. You will only find catfishes on discord. Let me be honest. Is it like a field for which openings are there or is it same the requirement as tech? No, I I don't think so. Freshes get hired in Phops and it's I work in Phops because my company desperately needed some employees uh some like manpower in PHOPS as it's a very recent priority. I don't think so you particularly get hired for PHOPS.

[01:49:09]Fin just basically helps me understand AWS and Azure on a broader context like reserve instances savings plan all the different services what are they eligible for saving my company money in cloud costs that's basically following the best practices on phob just search the phob subreddit on Reddit bro have you monetized your channel don't [ __ ] ask me I've lost all the money that I gained ranking system for goon countered shut the hell up sinister. Bro, you're always going to win. No, bro. You would be writing last year and all. My contest score and lead lead code research. Yo, hold on. Hold on. Look at what this guy is saying. My contest score and lead code. This guy is saying Dendra Solanki is saying my contest score and lead code reset to zero. Do you know why that happens, brother? Do you know why that happens? Do you know?

[01:50:04]Do you know why that happens, brother?

[01:50:07]because you [ __ ] cheated and got caught and got caught and the [ __ ] baddies chat timer also GF calls you I'll just I'll just add a custom metric format so that you can add your own metrics bro if you want to track cheater got caught with that variable cuz you performed too good shut up yo should we look at the email that I sent to those brands for sponsorship bro sponsorship did they reply let's see if they replied or not bro let's see if They reply to my email.

[01:50:38]They [ __ ] did not. Hold on. It's a weekend. Why would they reply on a weekend? Yeah, they would not reply on a weekend, which is fair. They would not reply on a weekend. They have not replied it yet.

[01:50:53]Okay, they've not replied yet.

[01:50:57]Bro, remember me? Yo, is it Yo, Jean, are you are you from mate? Jean, are you from mate? Bro, I created an account just 5 seconds ago and I forgot the password.

[01:51:07][ __ ] dude. Yo, the for password option might just be missing. Hold on.

[01:51:34]Oh [ __ ] I was muted. Give me one second.

[01:51:41]Give it one second. Oh, I'm going to be prompting Claude to add the forhead password option because I ain't writing a [ __ ] line of code besides DS. You're not writing a bro expose a bug on stream. Bro, these bugs. Claude is responsible for these bugs, bro. Bro is back to 1,800 plus code rating. Let's go. Let's go. Jean, who the [ __ ] are you, bro? Tell me your name. Jean, bro, tell me your name. Do you you guys want to know what this [ __ ] did? Bro, I went to a senior junior interaction in my college where juniors were asking me questions and this asshole's question was, "Does minoxidil work?" Are we [ __ ] serious?

[01:52:25]When I'm in a college meet and you're asking me, "Does minoxidil work?" Are we [ __ ] Kavia? You're Kavia.

[01:52:35]Bro, you're getting your ass whooped today. Kavia, bro, you're getting your ass whooped today. You're cavia, bro. I didn't expect this from you. You're getting your ass whooped today, bro.

[01:52:44]Cavia, bro, you're getting your ass whooped.

[01:52:47]When I'm sitting I'm sitting in a formal settings, bro. In a formal setting in my college meet, juniors are asking me question and this guy is asking me, "Does minoxidil work?" Yeah, bro. You're getting your ass whooped, Kavia. Bro, I'm about to whoop your ass now. Are you ready for back shots? Yeah, bro.

[01:53:07]Just shut up. Just shut up.

[01:53:10]Okay, I guess that's it. That's it for this stream then.

[01:53:14]Good week. Start tracking [ __ ] on track my life. I don't know how much rated does it need to get night 1840. 1840 1850. We all know why you went there, creep.

[01:53:25]Where? Where? What's wrong in it? He was concerned. I've still not applied Minoxidil. Today is the day I'll apply Minoxidil, bro. Scribble now. Scribble is just too [ __ ] long. Help my GF give T. The [ __ ] do you mean T, bro?

[01:53:42]GF gifts. T. What does that even mean?

[01:53:44]Maybe that is the only question you can answer with prolevel experience, bro.

[01:53:51]Is okay. Even if I can answer is that a question to ask during [ __ ] my college meet int valu nams as requested by the question that yeah I know somebody yeah that's [laughter] that's what cheaters do bro that's what cheaters do okay again I'm saying I'll be vlogging my each and every day on trackmylife.live live. If you do too, I'll review yours too and I'll review mine too at the end of this week on the next weekly contest stream on next stream I do. It was so damn bad. He just want to back juniors at this point. It was an online [ __ ] meet, Praep, you dumbass. It was an online [ __ ] me.

[01:54:34]Shut up. How do you feel about your CTC?

[01:54:37]17.3 LP, 15 LP fix. That's a lie. That's a lie. I don't know. Where did you get those numbers from? That's some grass.

[01:54:45]Exactly bro. Exactly.

[01:54:47]How to think for the third question or fourth? I solve 300 problems in lead code. I still can't.

[01:54:54]Harsh Kumar Gupta. Just make sure you obsolve it. And now the next time a question like this comes, you can solve it. That's the only way to look at it.

[01:55:04]If you couldn't solve it, no worries, bro. I forgot password option. I'll prompt Claude to do that. I'll prompt Claude to do that. That's it for the stream, bro.

[01:55:15]Does iron give Cloud Max? Nah, bro. They they give they do give Cloud GitHub Copilot Pro version, but I'm using my own my own cloud pro. I've bought my own Cloud Pro. That's true. Maybe even more.

[01:55:31]What? Yeah. Is promoting own project allowed here? Sure, bro. Sure.

[01:55:38]Company location.

[01:55:40]I forgot to apply my sales option.

[01:55:46]Okay, that's all. How do you keep people private on how do you keep people private on your track my life? I would not see I've not added encryption. There is an option in settings to keep your profile public or private. But even if it's private, I would still say don't just just don't use it then because I've not added encryption. Either I'll have to add encryption end to end encryption so that even I cannot read your like the database currently storing plain text plain text for your daily logs. I'll see I'll see I'll improve it. Not me claude bro. I think you have a great potential to become influencer. You should try some different niche contents.

[01:56:25]Should I like what should I start bouncing on reals? Should I? Maybe, bro.

[01:56:31]Maybe. Maybe someday. If I get laid off or fired, we might. We might. What person minoxidil?

[01:56:42]5% minoxidil. 0.1% fins the ride. That's all.

[01:56:50]Okay. I'm yapping too much. I'm going to go sleep. Among Heist gaming, [ __ ] yeah, bro. Okay, I'm sorry. This guy can't just [ __ ] disrespect me like that. One immogle and I'm I'm about to mock the [ __ ] out of him. That's all.

[01:57:09]After that, I'm going to end stream, but I need to [ __ ] humble his ass, bro. I need to humble his ass.

[01:57:18]You won because it was It was I don't know. Why did you want join this?

[01:57:26]Been using five person been five person using it for an air gun. Got only baby hairs, bro. Hold on. So, did you use winsterite too? Did you use finerite too, bro? Or only minoxidil? Mine is a mixture. Ice gaming. Join brother. Join if you have guts.

[01:57:46]Okay. Morgle with showing your hairline, not hiding it. Shut up. Hello, Takubai.

[01:57:54]Hello. And he got [ __ ] scared.

[01:57:58]Oh [ __ ] Oh [ __ ] Hold on. Hold on.

[01:58:04]Yeah, bro. Enough. Enough of you.

[01:58:09]This guy is going down.

[01:58:22]I just refuse to [ __ ] believe that he's a knight. This is absolute nah, bro. You're not. And um this guy attained a >> nine, bro. Shut the [ __ ] up, >> bro. What? What did he say? What did he say? And he got a nine yesterday, too.

[01:58:38]Is he Is he [ __ ] Marlon, bro? How the hell does he do it every time?

[01:58:44]He is Chad. Bro, he got a nine yesterday, too. And nine.

[01:58:51]I don't know, bro. Maybe he has a mustache or something. He got a nine yesterday, too. I thought it was a glitch, but he's really nine out of 10, I guess. Bro, lost to him.

[01:59:03]I don't [ __ ] understand. Fin step two, but his dumb ass gave him that.

[01:59:07]Now, guess shut the [ __ ] up. It's not that bad.

[01:59:12]It's not that bad, bro. Why don't you explore and get some girls? Where, bro?

[01:59:16]Where can I explore? Tell me where can I explore?

[01:59:19]App is white coded, bro. Bro, how the hell does he always get a nine then?

[01:59:26]Any tips for me just to get an internship? I'm a BCF student. Build in public. Keep the face like stone emoji.

[01:59:35]I was even flexing my traps and [ __ ] monkey. Okay. Okay, he he got nine again. Bro, this guy is a Chad. He might just be a Chad, bro.

[01:59:49]Okay, then Monkey app have to find girls.

[01:59:52]There are never any girls. Are there Are there girls in Monkey app?

[01:59:58]Are there actually girls in Monkey app?

[02:00:00]Oh, it's all it's all men. It is. It is all men. That's why I'm not even trying.

[02:00:05]M Thailand 69 weeks. Shut up.

[02:00:10]Approach every girl you see.

[02:00:13]Bro, these guys are going to [ __ ] get me land in jail or what? Let's do once more with him. Shut up, bro. That guy has I don't know. Is he hacking or something? He always gets a nine. I don't I don't want to do it. I don't want to do it, bro. He He gets a nine every time. High gaming. I don't know how the [ __ ] does he do that.

[02:00:32]Okay, it's 10:00 a.m. Good weekend.

[02:00:36]Track my life.

[02:00:39]Let's Let's meet the next weekend. Hope you have a good week, bro. Keep tracking your days and we're going to review them next week. Thanks for joining. Bye-bye.

[02:00:50]Have a good week.