Live AtCoder Weekday Contest 80

Added: 2026-06-01

[00:00:13]Yes, I'm live, right? Yes. Yes. Yes.

[00:00:20]Me open the VS Code.

[00:00:26]Okay. Yes, I'm live.

[00:00:30]Open the chat window. I like the color they used.

[00:00:36]It was glassy pink, glassy green.

[00:00:44]Okay, let me register.

[00:00:51]It's a long time after a long time. Like it's been a week.

[00:00:59]like I haven't part like yeah last time I tried but in reverse order will go in A to B then sequential order cuz at quarter nowadays start introducing a problem statement which is quite lengy.

[00:01:21]Yeah let's read the first problem.

[00:01:24]Takashi is a leader of a bomb disposal squad. There are n buildings are line up from end to end. Okay. Unfortunately, MX occurs in the area. The J occur center at the building TJ with power DJ. Note that the same building may be the center of multiple explosion. Okay.

[00:01:46]If J explosion occur the following durability reduced. Okay.

[00:01:53]J explosion occur the following durability reduction take place. Okay.

[00:02:00]The durability of building is decreased by DJ. If TJ is greater than equal to then durability of T minus one decreased by this.

[00:02:12]Okay.

[00:02:14]And TJ is less than N minus one. The durability of building is decreased by okay. So let's say these are the buildings.

[00:02:31]So if here if some explosion has happened then durability of this building divide by two reduce by half and this building also reduce by half.

[00:02:42]Okay. It denotes too at most the explosion affects at most three building for this building it's become zero for this building it is DI DJ by2 DJ by2 okay the damage of each exclusion determined as described above regardless of building currents durability okay so the order in which the M explosion occur does not affect the reason okay the order does not matter Here durability can become less than zero. Okay.

[00:03:19]Even if a building's durability drops zero or below it, it is not removed from the row and continue to affect by sequentially explosion as usual. Okay.

[00:03:32]Also, if such a building become the center, it's affect the surrounding building as usual.

[00:03:39]Okay. So uh the point is let's reduce the minus min - plus right let's say durability is minus2 and explosion occur at this building then durability become decrease by here it's written decrease is -2 -2 it's become zero right -2 - of -2 it become zero So that is what they are stating here maybe. Mhm.

[00:04:16]So after find the number of buildings whose durability is one or greater.

[00:04:22]Okay.

[00:04:29]So what I'm thinking is we'll perform the explosion in uh increasing order and that will be beneficial for us. Why?

[00:04:42]Let's say uh we have sequence and here are the buildings.

[00:04:50]So if we want our answer should be deterministic.

[00:04:53]So what we'll do is let's say this is the first building. These are the mark will like it. It will go explore somewhere sometime.

[00:05:04]So what will let's say this is also so first we'll explore this and then we'll explore this that doesn't that will also fine.

[00:05:16]Yeah we can explore in any like uh any order.

[00:05:23]Okay we can explore in any order. Yeah, that's fine.

[00:05:28]Then this is a straightforward question we can do here is bring my chat window here.

[00:05:40]Buildings height sorry what's H1 initial durabilities. Okay. Initial durabilities n vector of int h of n se h. Okay. Now we have q queries.

[00:06:18]What's ti? Okay. TI TJ is the building number and it is a oneway index right okay we have to convert it to zero based then less than n and i ++ okay let's say t and this is d is the power like power of explosion you can say so t minus minus so what we'll do is h of t minus is equal to d and if t -1 is greater than equal to 0 then h of t -1 - = d by q if h + 1 is less than n with just a boundary check so it'll not fall into Our segmentation error here is equal to d by 2 and this is a t right t okay yeah that's it now we have to calculate the answer number of building whose der is greater than equal to 1 simply iterate through h answer plus = x is greater than or equal to one or greater uh greater than equal to 1 and we'll return answer.

[00:07:56]Yeah, this is what potential solution should be.

[00:08:04]Yeah, it pass right.

[00:08:07]Let me submit.

[00:08:13]Now we'll move to the next question.

[00:08:26]It should pass.

[00:08:28]Yeah, it is.

[00:08:32]Let's move to the next question then.

[00:08:34]Yeah, we got accepted.

[00:08:38]Quality inspection and product disposal.

[00:08:40]Disposal. Okay. Takashi is the quality control manager of a factory. The factory has a system where manufacturer product are periodically inspected for a quality end product and product that does not meet the standard are disposed of. Okay.

[00:09:00]A factory is end product and quality score of product is AI. Okay. Tagashi perform Q quality inspection in order in the J inspection.

[00:09:12]A threshold value is TJ set and among the product that has not yet been disposed at this point all the product whose quality is less than TJR dispose of. Okay. Once product is disposed of it is no longer it is no longer subject to a sequence in subsequence inspection.

[00:09:37]Note that the threshold value T is determined independently for each inspection. So it may be smaller than the previous that's fine in that case relevant product has already been disposed of the previous inspection no new products are disposed okay that's fine immediately after inspection number of product newly disposed of the inspection is recorded for all the Q quality inspection determine the number of product newly disposal for each so yeah let us summarize what the question is asking we have n product we have n product and we have q queries is right each query we will introduce one threshold let's say t is our threshold so we'll see how many product whose uh quality is less than t that what we have to uh answer for each query that what we have to answer and that product will remove Okay.

[00:10:42]Okay.

[00:10:47]So, we need some good data structure who can keep track of this whole thing. Do we have any data structure? If yes, we'll simply use the data structure and we're done with the question. If no, then we have to come up with an optimization algorithm. Let's solve this question. So for that let's first say the constraint constraint is pretty good right constraint is good here that means we have to think a better algorithm so what we can do is sorry what we can do here is let's say our threshold is x uh we have uh let's say we sort this quality all the product quality based on the quality we sort the product A1 A2 A3 these are the sorts oh yeah we can use binary search right because this is sorted till a and dot dot dot Okay. So we want to find how many products how many products are quality uh whose quality is less than t. We can use simply binary search and we'll get this right. So for first query we have answer. Now the point is we have to store our answer actually.

[00:12:27]For example, say uh now we get another query and for that query t is let's say this is t1 let's say this is t2 for this two we already remove this many right so t1 is greater so for example t1 is five so we'll remove all the product whose quality is less than five so let's say these are the product whose quality is less than five now we get next query so for next query query. What we see here is next query is let's say two. So we already remove all the quality all the product whose quality is less than five. Obviously there's now there's no product whose quality less than two right. So yeah what we'll do is we'll keep track of maximum threshold that we have removed.

[00:13:20]Right.

[00:13:24]And if new threshold is greater than this T1, let's say this three and threshold is this. So we'll again do binary search and we find out this index which what is our last uh threshold?

[00:13:38]We subtract. Let's say these are the new product that we have to remove. Yeah, this we can do, right?

[00:13:50]Let me code it out.

[00:13:55]What we'll do here is let's N and Q se N and Q.

[00:14:04]Wait a minute.

[00:14:09]Okay, that's fine. Okay, we'll take all the products here. Let's see. E of N C. Now we'll sort out. Okay. Okay.

[00:14:24]And previous threshold, previous threshold is zero.

[00:14:32]And yeah, that's it.

[00:14:35]Less than Q queries and I ++. Okay.

[00:14:43]And previously how many product we have removed in let's say previously remove is also zero. Okay. Now we for each query we introduce one new threshold. So one new threshold t. We'll check here if this t is less than or equal to previous threshold then there is no new product will dispose right then simply print no and continue.

[00:15:20]Okay. Else now the new threshold the new now we have to answer how many product we have to dispose if the quality threshold is t and we know and so what we'll do here is we'll perform binary search and find out the break point.

[00:15:38]Let's say these are the product and current threshold is x. So using binary these are sorted right. So using binary search we found out this is the point from before this point every product has threshold less than x and after this point average every every product has threshold greater than x. So this any product we have to remove. So we'll perform your binary search start is equal to zero let's say end is equal to n minus one while start is less than equal to end.

[00:16:13]This is typical binary s code actually I have I don't I coded has many times so I it's like mug up in my mind a pattern you should always start to remember okay there's no interactive guy in the chat you guys you can post like your thoughts in chat like in live chat that's fine so what we'll do here is if a of mid is greater than equal equal to as greater than t that means uh the index we have to find right. So index is minus one. So index is we have to find the last index whose threshold is less than yeah greater than this is our potential answer and end is equal to mid end is equal to mid minus one else start is equal to mid + one okay now we have this end point Let metric putric minus one that's fine.

[00:17:33]If index is not equal to minus one that is that means we found out a break point. So what we'll print here is answer is zero.

[00:17:46]So answer is equal to index index is zero base. So there are n + 1 minus what previously we remove and previous remove is equal to answer.

[00:18:03]Okay.

[00:18:05]No it's it's just index + one.

[00:18:11]That's it. And we print our answer for this query.

[00:18:21]What we're getting here is uh one extra, right?

[00:18:32]Okay.

[00:18:39]Index plus W wait, let me not guess. So what is index? index is the first point.

[00:18:48]What if index is minus one? That means we haven't found out index is not uh let's debug what's index we are getting.

[00:19:03]Yeah. So we getting two and let me put the sorted order also.

[00:19:14]See this is right a threshold is two 0 one. So we are getting this.

[00:19:22]No we don't want that. So we what we can do is is less than equal to t. Then this then we'll do start is equal to mid + one. Now see we can modify binary such as per our requirement. Right?

[00:19:48]A of mid is less than equal to this then this uh this is n.

[00:19:57]Yeah. So index is equal to 1 right? Index equal to 1 means we have to remove this two element.

[00:20:07]So this is uh 2 - 0. So we have so for first case we are getting two that's fine. Now we are getting new threshold that is four.

[00:20:19]So our 4 0 1 2 3. So it's less than or equal to strictly less than. Okay. Okay.

[00:20:29]Strictly less than they have.

[00:20:33]Okay. We're getting this. Now we're getting index equal to one.

[00:20:39]Uh for zero we getting index equal to one. This is not true. Actually now we're getting one as our index here.

[00:20:51]The threshold is zero. Right here the index should be minus one here.

[00:21:01]Uh wait.

[00:21:03]T right T I'm just checking if I didn't mess up while taking the input see T is three here that's not okay okay okay t is three here that's fine so t is three and oh we have to also update our previous max of previous t comma t. Yeah, this is what yeah we're getting right 2 1 0 here 3020 that's and 53. Yeah, that's correct. Let's submit 48 68 and yes we get accepted.

[00:22:23]This is pretty not bad. Look, it's decent question.

[00:22:30]Nice, nice, nice. We are at third problem. Reward for carrying luggage. Okay. There are n rooms arranged in a row. Number from room one to room. Okay. Takashi in the room one by one in order from the room one. And each room he choose either accept or decline the job offer there.

[00:22:51]Each room has exactly one job and he visit each room exactly once. Okay.

[00:22:57]Uh each room I has the job with type TI and reward AI. There are two type of jobs. Landing job is TI is equal to one that is a loading job. Sorry it's a loading job. If accepted he'll receive a reward AI and pick up one piece of luggage. Number of piece of luggage he is carrying is increased by one. Okay.

[00:23:18]Unloading job ti is equal to zero. If he accept he receive reward ai. If he carry one or more piece of luggage he put down one piece and the number of luggage decrease by one. If there is no luggage then nothing to put down. So the number of piece remains zero. He still receives the reward. Okay.

[00:23:38]Yeah that's fine. So at each point we have choice that that like that we can understand right at each point we have choice uh to take or not take or not the num the number of piece of luggage is initially zero throughout the process of exiting and and declining job the number of piece of luggage must not exit K at any point okay this is another constraint we have to keep in our mind okay this is because carrying too much luggage would be unmanageable.

[00:24:17]Additionally, the number of pieces of luggage must be exactly zero afterh what? What? What? Wait. Additionally, the number of pieces of luggage must be exactly zero after visiting all rooms.

[00:24:31]Okay. This is the end of the visiting order. We should left with zero luggage because he can't go home while still carrying luggage.

[00:24:42]Determine the maximum total reward of the job takashi accept while state satisfying this condition. Note that this is possible to accept no job at all. Okay. Okay.

[00:24:59]This is a pretty good question. I can feel at least.

[00:25:16]Can we use DP here?

[00:25:24]We can, right?

[00:25:32]We need to use DP here because we have choice at each point. Take or not take.

[00:25:47]What can I do? What are the possible approaches we can approach this question?

[00:26:01]audible right throughout this time. Yeah.

[00:26:13]So at each point we have choice. Okay.

[00:26:24]H we can use DP here. What will store in DP?

[00:26:29]Total uh maximum reward. Yeah, we can use DP here.

[00:26:35]Let me formulate the DP.

[00:26:39]So DP of I represent what they ask total reward of the job.

[00:26:55]But wait, this is quite This is quite interesting, right?

[00:27:19]Because uh I need a definition of DP first of all.

[00:27:25]I need a definition of DP first of all like what I store in my DP if I write out write down few things here. So what I guess is DP of I is equal to maximum rewards from 0 to I and luggage is also zero. That's something difficult to handle.

[00:28:10]This is one Next award from 0 to I and H is zero.

[00:28:18]Can we can we track this?

[00:28:22]Uh-huh. And in between we have max load is less than equal to K.

[00:28:41]So we have to manage this thing this many thing.

[00:28:46]It can be 1T DP actually we don't even need information we or we need we need right wait why I'm feeling sleepy we need information So at each point can we do greedy here?

[00:29:32]Can we do greedy here?

[00:29:36]No right see before before see we know right what are the let's say okay we know the sequence right beforehand that means we know how many loading jobs are available and how many unloading jobs are available variable at any point.

[00:30:11]Yeah. Okay. Okay. We know right. We can help uh we can use this information.

[00:30:28]So we need to pick at max if I okay. So we need to pick at most 2k jobs.

[00:30:43]In this 2k jobs k are loading jobs and k are unloading jobs.

[00:30:54]Yeah. Or it might possible key loading jobs can be less than K also but it is always beneficial to do yeah it's always beneficial to do K unloading jobs right because see we'll all anyway we'll get reward if we don't have luggage with us and we took that job.

[00:31:29]So we'll always perform.

[00:31:33]Oh the question is now we'll always perform no not K uh see let's say we have count one and count two count two is the unloading job. So we'll always perform all the unloading job that's for sure right now for and this let's say this is the bare minimum answer we only perform unloading job let's say that is min one can we improve this so what we'll do is for any job any unloading job J we'll Find best loading job I which is less than J.

[00:32:29]Right.

[00:32:36]Yeah.

[00:32:48]H. This is what we can do.

[00:32:54]We can maintain two priority Q here.

[00:32:57]Main priority Q and max priority Q or set anything can work right or multi set. Multiset will also work here.

[00:33:18]Yeah, got it. So, what we'll do here is we'll perform greedy here. We'll not use DP.

[00:33:28]So, how we'll perform greedy here is it's a good grey question then.

[00:33:36]Yeah, int n and k seen n and k. Okay.

[00:33:43]Yeah, let's go. I is equal to Z is less than N and I ++.

[00:33:51]Okay, so we have to what we have to do greedily for uh if it is a loading job, we'll keep tech taking we'll keep taking the loading jobs.

[00:34:13]Yeah. And if it exceed K so we'll remove the loading job we have already taken and which has a less reward right that we can remove.

[00:34:26]Yeah. So what we can multi set we use multi set here.

[00:34:35]Yeah.

[00:34:37]and type and the reward.

[00:34:44]Yeah, if type is equal to 1 or zero.

[00:34:48]Yeah, if type is equal to one, see, we need to perform a greedy here. Did you guys get it? What I'm trying to say? So, what we'll do is we have constraint. We can't take more than K luggage with us, right? That's that is one constraint.

[00:35:03]And another constraint is at the end at the end.

[00:35:11]Uhhuh. That's fine. At the end we don't need any luggage. So we will not confuse with the what question is asking. What we'll do is if t is equal to 1 we'll insert into our set a. This is the reward. Okay. and and else and one more thing we have inserted this now we'll check if the size of HT is greater than K that means we have more than K luggage with us so we have to we have to drop actually this is the mimic we have initially we have taken all the luggage and now it is more than K1 so what we'll do is we'll remove the minimum element from our set that represent that in past we haven't take that luggage that's how we just mimic in f and future what we'll do is we'll find out auto it is equal to st begin yeah st begin and we'll remove this SJ dot erase it. Okay.

[00:36:35]So yeah. So now we are sure we will not we haven't pick up more than K jobs and else once we unload this.

[00:36:52]Yeah. If t is equal to zero then answer plus is equal. Let's maintain the answer also.

[00:36:58]So to un unload we received a right let's say a okay and what we'll do is we have used the previous job to take so at that point also uh what is the maximum so that is auto s uh it is equal to st end and st dot erase previous of it.

[00:37:48]I want answer plus is equal to this.

[00:37:55]It's a iterator or what? I don't know.

[00:37:59]It's a iterator, right? Need a value.

[00:38:04]Yeah, that's fine. We have removed this and we simply print our answer here.

[00:38:11]See, you need you guys need to visualize what I'm trying to say. So what we did is we'll keep maintaining a set set contain all the loaded value right so each unload what we'll do is we'll say yeah because we want our answer should be maximum so we'll always prioritize so what we'll do is we'll unload the maximum lo uh reward value that means that's fix will stick with this let me first And did I uh I'm getting right failed here. That's fine.

[00:38:53]Yeah. So what we have to do here is we have to keep uh put one check here size of HT then only we can do this this things right let me submit this.

[00:39:28]This is a pretty good question. Greedy greedy ocean, right? This is a greedy question. What's a good question?

[00:39:36]That's why I like at quarter see. Got AC, right? Yay. Got a C.

[00:39:47]This is the fourth question. Nice. It look like a graph question to me.

[00:39:53]Network construction. Okay. Let's write the problem statement once.

[00:39:58]Takashi is the network administrator of a data center with n server. The server number from one to n. There are m available cables. That is the connection between birectional. Okay. It's a birectional graph. Takashi want to select some cable to build a network for all n server can communicate with each other. A set of selected cable must be a spanning tree.

[00:40:24]Okay, a spanning tree in a graph that can include all the server and with n minus one cable. Okay, so this is one of the standard question you have to tell the minimum total installment then you can generate a minimum spanning tree.

[00:40:41]If exist contain all k output the total number of installment cost of n minus one cable including spanning tree. If no such spanning tree exist return minus one. Okay. However due to the security requirement a special set of k cables has already been cons contracted as a dedicated encrypted communication line and must be installed. So if a spanning state exist that contain all k cable output the output the minimum total installation cost of n minus see here I'm confused what they want is the kashi want to select some cable to build a network so that all n server can communicate with each each other okay a set of selected cable must be a spanning tree okay a spanning tree of a graph that contain All end server has a vertex where all the server are connected by a selected cable and no cycle exist. In this case the exactly n minus of cable are selected that's fine. However due to the security requirement a special set of k cables has already been contracted has dedicated encrypted communication line and must be included in the network. Okay. So question is you have to create a minimum spanning tree including this k cable.

[00:42:11]Yeah, this is what the question is.

[00:42:13]Yeah, got it. Got it.

[00:42:15]If a spanning tree exist that contain all then output the minimum cost installation that's fine. Yeah. So we have question is asking a spanning tree a minimum spanning tree that contain all this cable.

[00:42:35]Good question. By the way, this is another good graph question. It's a standard question. If you know how to find the spanning tree in a graph, then this is a cakework for you. But I don't even remember. So we'll think logically what we can do here is we have a graph just start visualizing.

[00:42:58]That is what I do generally.

[00:43:02]Let's say we have a graph.

[00:43:06]this and this cable and this cable we have to include.

[00:43:24]This is the graph.

[00:43:26]Okay, we have to include this cable and this cable.

[00:43:35]So what we can do here do I have any chat? No. Right. Okay.

[00:43:56]That's fine.

[00:44:00]What we can do to generate see this is standard question there's a technique we can actually calculate the minimum spanning tree there's a a bit change in this question is you have to include the specific node uh specific edges and then wait a Hey bro, how are you?

[00:44:41]Zippy creates uh this is chatbot one, right? A chatbot guy, right?

[00:44:53]So yeah, that's it. So we want a set of edges that create a minimum spanning tree and contain this K cables.

[00:45:05]Yeah, this is the what question is.

[00:45:09]Hi nice.

[00:45:16]We can use Dra algorithm here.

[00:45:24]We can use D algorithm right I have mentioned in my description. Let me show you.

[00:45:44]This is what I'm actually a master.

[00:46:07]Yes.

[00:46:36]Yeah, bro. Oh, how is this possible?

[00:46:44]How that balloon came?

[00:46:47]I didn't even realize.

[00:46:56]Hey, what? Thali, how to pronounce?

[00:47:03]First BT, first year BTK student.

[00:47:07]Yeah. Yeah, hand gesture. But I don't know how what's the gesture to reproduce. I know this is for heart.

[00:47:18]Oh, nice. How to pronounce this? Brain.

[00:47:22]This is your name, right? Or just a random tali. Tali. Tali is fine for me to pronounce.

[00:47:31]Nit dab.

[00:47:34]Marin moy.

[00:47:36]Oh, rain mo. This is your name. I pronounce correct right. Did I pronounce correctly?

[00:47:53]Uh minimum spanning tree. We have to I I know how to do min spanning tree but I forgot the logic behind.

[00:48:02]Oh, thanks.

[00:48:14]It's not matter bro. If you see code forces, if you see code forces, that doesn't matter. You are from IAT and if you're able to solve the question, you are in the leaderboard. If you're not, if you are not, how my YouTube is translating uh set up somewhere or what? I thought people always chat with me in English.

[00:48:44]That what I thought, but it is not correct.

[00:48:50]I don't know how to turn off the translation.

[00:48:55]Doesn't matter, bro. You can start learning. You can learn. And see nowadays you have a you know good one of the best technology phase you can actually talk you can talk with guys if you want the same mindset that you want right there's no boundary as such you can discuss your syllabus you can ask ask or doubt your anything you can do there's no Just point is I want to try D question. I spend my entire first year coding.

[00:49:34]That's good, right?

[00:49:40]I said why coding first coding. That's fine. Now you are exploring something.

[00:49:55]That's fine. That's fine. See why coding is not bad but the habit is also that you have to see.

[00:50:04]You have to control your habit. That's the reason I started doing in depth in computational neuroscience using numpy heavy. That's good start by the way. How to close translation? I don't know where to close this translation.

[00:50:22]How to close this translation?

[00:50:31]See you start with if you are CSA guy you need DSA DS. Why we need DSA? Why company ask DSA? They just need to know how good you are in thinking. If uh problems came in front of you so how good you are how what are the approaches uh with your tool you are able to think that is what they want to test that's where the concept of problems are this problem solving came into picture but people has taken in another sense I was studying from a book I love studying from book oh good boy seem like you're good Why I don't like to read? If you want, if you give me a laptop and tell me do whatever you want to do, I will do. But if you give me a book, I'll probably sleep.

[00:51:27]That's the thing with me.

[00:51:33]Actually, I start building book reading book reading habit. I don't know where Wait a minute. What's going on? Okay. I love studying from book. That's fine.

[00:51:51]How to close the translation? I don't know. Wait, wait, wait. Can we edit? Where? Where? Where?

[00:52:04]Yeah, this is good.

[00:52:07]Where? Edit customization.

[00:52:10]Oh my god. Live chat translation.

[00:52:15]Save.

[00:52:17]Yeah, bro.

[00:52:25]Uh, hi Shamu. What do you think?

[00:52:29]Thinking video loop is good or bad?

[00:52:31]Video loop means what's video loop means? uh watching video and learning things. That is what you call video loop.

[00:52:49]I turn off the translation right translator or not.

[00:52:58]What's video video loop? I didn't get your point. Samu Samu is right. Mr. Some Yeah, that word I pronounce. I guess it is correct.

[00:53:14]Yeah, some people always learn from video.

[00:53:17]It's not problematic. It it it will problematic if you just if you're not applying your brain. Let's say for example, I wrote some code, right? And simply you just watch the video and you wrote the similar code in your editor and submit it and you feel yeah, I learned something new. No, this is not work. This will not work.

[00:53:39]If you think yourself and you write code yourself, I like back back in my college days what I usually do, I I watch this style uh video and whatever he explained me, I thought yeah, this is this is good. This is good. And after at that instance, what I do, I just just search the question and start typing. So what is this? Whatever I remember in my mind I'm just typing. So that is not learning actually. While watching video you saw the code and just went to that question and just start solving this question that means you're not uh yeah if then you focus what you complete. If you're watching then you focus when you complete all video and then and your pro what should be done rather than DS or placement or internship DSA is necessary for placement internship right I can suggest if you love DSA then follow 60 10 60% and 40% 60% DSA and 40% development if you don't like DSA but Still you need a DSA knowledge, right? To crack enter your placement because the initial rounds are DSA only.

[00:55:01]Yeah, I'm on Mac.

[00:55:06]So what you can do if you don't like DSA, so what you can do, you need a DSA knowledge. So you switch the percentage 40% DSA and 80% your academic work or your development work. That's how you can probably manage right. Did I miss someone chat?

[00:55:25]No. Right. I'm here. If you watching then you focus when you complete all. If you see the good solution is if you want to learn something just learn the concept. Don't even try to mug up the code. Learn the concept and don't just go an editor and just type start typing.

[00:55:45]If you want to learn just learn in a book and paper. What you can do is just watch the video take the book and paper write the concept. If something is like this I have to do this this this don't just go into quadrant type the code and submit. That's not the learning what I feel answer tell uh hi abishek hiishek the question do tell me that what is the size I didn't get.

[00:56:14]What is the size of empty class object according to you? I didn't get your question actually. Can you can you can you can you ask this question? I didn't get your that's why this balloon. Yeah, I got it. There's always a gesture using gesture you can create a effect.

[00:56:37]Wish has another question. If class If class contain numbers members function then tell me what may be the size of the object. It's a sum of ah I got it. Oh you are asking you have created a class with the integer. It's a sum of all the integer sum of all the variables.

[00:57:03]If first is development second that's fine it's not always first is DSA. you can follow 60 40% split I mentioned right for 40% DSA is just the necessary to crack the interview and DS actually help to build your problem solving skill also right then mir has moi uh it's hard to pronounce dali is good to pronounce actually I don't like development every new development project can be done try some X Y Z I don't know my see development doesn't mean you have to create UI right development doesn't mean you just need to create one API see if you think that is what the main misconception is development is like for example say I want to build a banking application so to build this banking to develop an application we need to think a proper architecture behind like how we will manage a concurrence transition Then OS level this OS concept came here concurrency how we can uh run two concurrent transition will not create any anomalies in our database so this is a part of development right this is the part of system level development system level thinking right so development is a vast field DSA is also vast field right so it's based on your interest how depth you will go and how good concept you learn that's what make V from your finger this way does it generate anything I don't think so this icon I know there's one gest I I know there are some gestures and Shanu there's a question from Shanu if I completed my bachelor 2026 and after three year can I find job.

[00:59:07]It's totally based on how hard or how good your skills are.

[00:59:15]See to get a job it's not easy. I I can understand but has a being a skilled person and I can understand your pain though getting a job is hard but just have a skill. If you get opportunity, grab that opportunity. That's the what the subdomains are good backend system.

[00:59:37]Yeah, I agree. I agree. Dari Abishek is some uh what's nobody tell me the size of the empty class. Class do not have any member in it object. During my placement, I have actually learned this concept. But right now, I don't have a good memory. like I I'm not able to recognize there are concept like class itself took some memory right empty class empty class in C++ size this is what you are asking right a size of an empty class is one by default click the green video icon in s. Yeah, I got I got it. Got it. I know.

[01:00:32]But I don't want to try the gesture for now.

[01:00:40]Okay, you can run.

[01:00:46]I have question. Yeah, breaking king Ronach. Yeah, Ronach, what's the question?

[01:00:53]Tali also using some knowledge of web code in general I also need yeah that's true but see if you notice somewhere whenever you use by coding uh agents so agents always ask you three problem like let's say for example say I I gave you prompt I want to implement this the agent will always do can I do this can I do this can I do there always a human interference right. So if you have good system develop uh system design knowledge then you will pick the option which has the good uh system building capability right so after bachelor I'm doing non- tech job and also improving myself for the condition can I find yeah you can find just improve your skill and start building your connection over LinkedIn or somewhere else and then get a good referral and then apply as a fresher.

[01:02:08]If you are good at Java then you probably apply for develop see job in a job you always do development right but if you're good at uh DS and logic building then you'll good at the optimization the see we can create a feature X with some time complexity and we can create same feature with a better time complexity right if you have knowledge of optimization and a better system design or better DSA then probably you're better coder than someone else otherwise see someone is also able to develop feature X you can also develop feature X the only difference between them is the quality of code I have less than 60% in my 10th 12th place MCA eligibility MNC eligility it's not like See probably 10th 12 marks is is uh I can say is more focused in a on campus placement if like you know if company came to an on campus they definitely put 60% criteria most of the company not all but in off campus I I don't think so 10 12 marks matter that much it will matter it totally depend on HR and the hiring process of that company but I can If you're good at the skill off campus is mostly about skill but there are company actually who ask for sir like minimum 60% that's I understand yeah in off campus mostly they focus on experience and your knowledge marks not that much matter I according to me marks should not matter that Oh, I completely forgot this question.

[01:04:12]So, we need to generate a minimum spanning tree with this is the good question. I don't think so I have solution for now it's almost 10 and contest is also over So we have managed to solve three questions right and questions are not easier side it's a medium side I will not say it's harder also C1 is the one the similar concept I have solved earlier also that's why I'm able to recognize this so it's not magically if you guys you can like my stream that's how we can bring more more people to our discussion It was a pretty good discussion today ahead.

[01:05:00]See this is how you should ask the people. That's how you will get clear out of all the wrong assumptions.

[01:05:14]Oh, Rich finally is the man I always talk with. So Rich is the one I if nobody join I He joined. Yeah, I'm I'm at the ending the reach. I'm at the point where I'm ending the strip.

[01:05:31]Gate is the better option I can say if you if you have time because I did GATE and I got triple it Delhi right and yeah we if you get a better college you will get better opportunity through the placement.

[01:05:50]Yeah. Yeah. Okay, Rich, if you have time and if you have this is good one. Sun may fall but I will rise. Okay, this is good.

[01:06:11]You can definitely think of So you guys can like my stream that's how it can grow. Maybe probably a new to new users that's algorithm work. I think in live stream if you like it will give more impression to the new users.

[01:06:48]I actually do live stream daily on the daily basis around 4:30. You guys can join. If you have more doubt, you can ask. So that's for today. We'll meet tomorrow. Bye-bye. Oh, tomorrow is the Saturday, right?

[01:07:04]Uh I will do I will do I'll do live stream but I have to attempt the contest also tomorrow.

[01:07:15]If we chat more in the stream, it will get on the homepage of new user too. Oh, I didn't know this.

[01:07:22]Hi, Om Ratan Tari. What's your name?

[01:07:25]Your name is Om, right? Hi.

[01:07:29]Hi. Thanks. Thanks. Anu by thanks.

[01:07:37]Getting 2K rank in J. Okay, that's pretty good.

[01:07:43]You can message me on my Telegram. You can join my Telegram or Discord here. I have link.

[01:07:51]Oh, I haven't put your Telegram link.

[01:07:55]Oh, that is pretty odd. I can add your Telegram link also.

[01:08:02]Java. Oh, sorry, bro. I can't answer this because I haven't put in that much effort in Java. I do.

[01:08:13]Yeah, you can connect me on discord. I do in C++ mostly. Java is a see each language has its own specification and its own No, no. Java is not bad. Wait, wait, wait, wait, wait. It has an is has see C++ is good for it's fast like C++ is faster than all this Java and right because the purpose of C++ is different and the purpose of Java is different right JavaS can Java has own garbage collection that is not available in C we always need to free the pointer otherwise always taking the basis in Java you don't need to free or delete the pointers.

[01:08:59]Java is the own garbage collection, right?

[01:09:04]I'm a Java hater.

[01:09:07]I can't do it. I can't do anything here.

[01:09:12]Mhm. Yeah, I got it. See, Java is made up for the development purpose, right?

[01:09:17]There are still old company uh I'm not old old code base, I can say which still have Java. It's written in Java, right?

[01:09:26]And there are see there are still old software there are still pretty if you see uh Linux kernel is also written in C++ because it's need a speed so there are few good applications also very good best applications written in Java uh no best application code written in Java.

[01:10:06]Oh, I don't know about this app. Apache.

[01:10:08]Okay, I know Apache had.

[01:10:11]Okay, next.

[01:10:14]Okay, so that's all for today, guys.

[01:10:16]Netflix return. Oh, nice.

[01:10:20]Someone messaged me on are you?

[01:10:29]Okay. Okay.

[01:10:33]Someone messaged me on Insta. Are you from then only I can accept elastic searches for the data searching.

[01:10:42]Oh nice, nice, nice, nice.

[01:10:46]Someone in the stream messaging me on Instagram.

[01:10:51]I also follow so that we can connect.

[01:10:55]Okay. Okay. Okay.

[01:10:58]Okay. So, that's it for today. We'll meet tomorrow. Bye-bye.

[01:11:03]Have a good day.

[01:11:07]Okay. Okay. Sonic. Okay.