Live Mock DSA | GeeksforGeeks

Key Takeaways

[Music] [Applause] thank you hi hi are you sure this course is just for 2499 yes and you know this is the only course with this expertise across the world no way yes way [Music] don't delay enroll now Geeks learning together [Music] hi hi are you sure you can prepare for product based companies through this course yes sitting at home no way yes way don't delay enroll now Geeks learning together foreign [Music] thank you hello and welcome back to this amazing Channel Geeks for geeks this is abhinav I am currently working as a DSA Mentor at Geeks for geeks I am a ICP citizenist a five-star at code chef and I expert at code forces and this is a another session for mock live DSA and today we have Rahul with us so let's quickly add Rahul to the Stream hello Raul how are you great how are you yeah I'm fine so are you excited for this interview yes absolutely yeah great so guys before going on just let me know that if my voice and rahul's voice is clearly Audible and if if we are also clearly visible to you all just please please write a one in a chat box and then we will continue with the session okay just write a one okay great great guys so I think that it's fine we can continue so yeah so first let let me tell me something about you and your projects and uh your background shows up so what do you think sir I am rousing I am a fourth undergraduate at Jaipur pursuing btec in electrical engineering I attended internship at a company named decimal part analytics which is basically an investment company they are I worked on technology under Python and I also made two personal projects both of intent first one is sorting visualizer in which with the help of some event listener and by click events we can just sort the array whatever the array may be and second is drum kit again a front-end project JavaScript we can make sounds with the help of keys on our keyboard or with the mouse yeah okay great great so can you please more elaborate more about the projects means why you thought to Pro to just create that project just you said none at a visualizer and that drum so what excited you to make that project yeah so for sorting visualizer like it has basically a short story behind it like me and my friends were just chilling out in the college and my friend was doing that including like there is only just give that code and there is an output there's nothing like behind there's nothing like that we can understand from outside so I just made a project like how sort is exactly exactly then like how power should actually works so that was a motive for which I made sorting visualizer JavaScript and for the internship that was about okay okay great great amazing so I think that we are good to go for the next part which is the mock light DSC so okay guys just please hit the like button and so because we are just going to move forward to the main part of this session which is the DSA round so just hit the like button and then we will continue so Rahul uh I have sent you uh sent you a Google doc please open that Google doc in your laptop and share the screen for us so that everyone can see it you can take your time open the Google Doc and save the screen with us is it visible yeah you can open the okay great thanks so fine so let's start with the first problem ah the first problem is let me just add that in the in the seat only just give me one minute okay so here's the problem I hope that you can see it yeah so this is the first one where you are given with a string Str and another string which is called let's take it as pattern okay so these are the two strings that you have so what you have to do is that you have to find the minimum index of the character in string Str at is also present in pattern so this is the this is the thing that you have to do you can see the example here uh I hope that you are able to see it now and please Zoom that that's it for our viewers and also please guys let's just write a yes in the chat box if you are able to say clearly just please zoom in you can use the Control Plus yeah okay just select a little bit more for the beers to be just zoom it I think Control Plus is the key you can yeah okay great great so yeah here you can see that we are given with a string okay which is Geeks for geeks and the pattern which is given to us is nothing but set sorry what it is saying you is that you have to find the character the minimum index of a character that is also present in pattern you will see that e is a character which is present in pattern and it is also present in Geeks for you so it is a character with minimum index that is present in both States is that fine yeah are you getting the okay okay so this is actually the problem is so how we can approach it the approach that is coming to my mind is like I can just iterate the pattern and for every character I can just find the minimum index in the string basically and in all those characters that I founded for which I found out the indexes I can find the minimum one and I can just find the answer like infinite if I if it through the driver in this case I will just take pattern first character is s so the index for s in the given string is you can write I think you can write your approach in the seat too I am able to see it yeah yeah so we will just cited in the set like first character is us I will just show the dragon first character is s in pattern right and by just linearly iterating over the string hydrating over the given string they can find its index that is present minimum index which is here 14. okay index is 14. now for if we do this similarly for E we'll find indexes one and if we if we again do this for p if we can't find the Nexus it is not even present in the given string e naught n so we can find the minimum for all this indexes which will be one if I have got the question like this is the approach that is coming to my mind okay okay fine so for getting the index of a character what you will use so to get the index of a character means your signal the first character of first car is s uh Str is 14 so it means how you can you just please write a pseudo code for it okay okay let's I get a character C right from the pattern okay okay and more yeah and I just iterate over the string decided over the string and check if I is compared to character whenever I find I will just Mark the index which is here the index is the variable which will store the minimum index for that particular character let's say this index is integer index is -1 is if we find that index is that element that is where that the character that we have taken from the pattern is equal to the character that is in the string we'll just Mark the index and break from here just scroll down the seat actually that that's not visible just make it in the center whatever you are writing scroll it down not a zoom out yeah fine okay okay is complete [Applause] [Music] [Applause] okay so you are basically iterating from the from the string only now for the first time and what does that see what is that connector that character will basically will be coming from the pattern yeah okay okay and I can just find an email for all those indices that we will have okay yeah time complexity will be go find into M because I will be editing for each and every character of pattern I will be iterating over all string in worst case yeah but if you will see one thing uh okay okay yeah if you will see one thing Rahul uh you you are saying here that whenever you will find a character which is equal to C so you will just take it in the index and you will break so I think uh so at the last what you will do uh yeah so at this point I will have a particular index for the particular character right okay so this is for one character right and for every pattern character like for every four S for e and t I will get three different values of indices right and I will take the minimum for oh three of them and I'll find the answer minimum of them yeah okay let's let's take a corner case okay okay let's take that pattern is ABC and this thing is Geeks for gigs only what will be your answer according to that if you see all they are not even present in the string only so that this so let's take that uh let's take on on that case or two output minus one only so and I think that your answer will give minus one only on that yeah yeah that's fine okay okay so the yeah can you please again tell me the time complexity and space complexity yeah for choosing this character C we will have to attend our pattern right yeah so let's say the length of pattern length of the string pattern is n okay okay and length of the length of the string is an HDR okay so for every character in the pattern which we will have to write it to our whole whole string right okay so for every character that basically means the length of the pattern is n and for every character in and I will enter it to a hosting SDR inverse case so it will be of n into m m-hmm got it got it got it yeah uh can we opted can we optimize it more can the space time complexity can be optimized is it possible to optimize the time complexity means instead of using this nested Loop can we do anything else so that the time complexity can be optimized people think yeah take your time you can use pen paper you can use all the characters in both the string will be lowercase right or they can be a package letter also uh let's take a lowercase okay I think it can be optimized oh yeah and one more thing that I I was I just asked you a communication luckily for that communication works and uh your output was management but what my reason for that corner case was that just just scroll down and you will see one thing okay you are finding the minimum for all the indices for that IND yes let me just uh yeah I got the point what I will do is I will mark this indexes I just maximize I just give you a hint also I just give you a hint also before also yeah got it so should I should I give you the clear approach for the first like for time complexity one hour I should give the optimize approach that time just I just thought right now just the thing is that you have to change the value of this index now yes maximum okay now tell me the tell me about my optimize one yeah it's a good time complexity okay so what I thought was that for iterating every character is not worth it so what I will do is I will make an unordered map and will I Mark the every character will be marked as let's say anything related to the integer maximum okay I will make an another map in which I will Mark every entry as every character in the pattern as integer maximum key value pays another map of basically key values in which for every unique we have a value right seven Mark S as integer maximum e as integer maximum and T is integer maximum now what I will do is I will iterate over the string okay and I will just find if that particular element is in like if I will just check if G is present in the hash map because if it isn't it it doesn't make sense to make Market entry in the another map right let's say like here G is present in the string so there is not any point like marking G is index in our unordered map it will just list of our wastage engineering so I will just have e solution is integer maximum so what I will do is I will find the minimum of the particular the current value in the map and the current index so in this case it will be marked as a maximum okay just just write it just write a report for it okay a quick pseudo code for it now I just scroll it down now I scrolled it down the state yeah yeah okay yeah it's fine so why are you taking another map what's the reason behind taking down yes we can also take nap but in that in map inserting and deleting the elements take log in time basically and when we take another time accessing the element and delete in the index we go up one time so in what cases we use map only in what cases we don't use another map in map view basically when the keys we want these to be insorted only then use now but here I don't think that ordering will matter that much that's why it's another yeah actually let me tell that uh whenever we have to deal with the keys as it said it was correct and whenever you have to iterate to the map actually because I created an unordered map takes quite more time than the map so that is why when you have to iterate or going to play with the keys we do this thing but whenever we are taking a map just to store some value that AI is present or not just for the frequency type thing so in that case we can just use the unordered map okay yeah because random accessing it is not so necessary yeah great you can continue yeah okay to be in here I among all the characters of the pattern into the maximum right okay thank you so what happens basically is if I find a particular element that is in the map that basically means that element is present in pattern also right because I have only Mark entries of the pattern only here okay so if I find a particular element in the given string I will find if it's if it's given indices is minimum then the current indices that is present in the map okay so now finally I will just iterate over our map okay fine uh just one thing uh so you are fine I think that I've got a logic actually it's fine uh okay after that what you're doing you are again I'm trading the map yeah for finding the minimum Index right yes because I have to find the minimum index like for all the entries I find indexes only and for for all of the entries that are not if I have to find a mirror next that is something that I have to return the answer right okay okay but but I I don't think that is necessary first year yeah each character then you are finding a minimum amongst that character yeah yeah that's that can be done on the in the second Loop also like here also that's what I think yes that's actually initialize the answer he finishes the answer as in either answer yes okay okay now one more thing should work it is it so yeah again this contact here if answer is minimum okay okay right but you have to Output the uh but you are I think you are taking a minimum of index of that value uh in pattern string because that map will give the value in the pattern is it's but I am marking the only the string values right I am here marking the that's I is coming from you you are taking answer is equal to minimum of answer comma and MPP and that MTP value will always be in the max that that map value is always into max now look that is change here right like like I can just do the trial okay okay okay okay one more thing no no it's fine I've got it but now just just the thing that when you will I train and whenever you will find a character which is or which was present in pattern and which is also present in this string you can directly return the answer at that time because obviously that is the first character there is no because all the characters after that are obviously of value greater than it that is the first character are you getting or not as you are finding the value of mpps stri minimum of mppscr I Comm I so that I will always gone increase are you getting another thing yeah yeah makes sense kidding yeah press return die from here on the right okay great so that that's what it it's great travel okay let's uh should I tell you the timing space complexity for this yeah yeah please yeah time complex it will be go of n plus n like okay n is the pattern pattern length and M is the string length because here we are basically iterating one Loop for string and one Loop for pattern so time which will be big of n plus M and space composition will be go of big of n only because we are making map in which the entry will be only for pattern yeah okay okay okay great great fine so it is it is n into n or M plus n for this one for time composition to M plus and only yeah one person and what is the space complexity we go off and like because we will be having entries only for pattern only right okay okay fine so let's move towards the next problem I think is it fine the next problem okay so I have added a link uh you can just check it just below in the seat I have another link to a problem you can just yeah you can log in I am I'm on setting your screen you can log in you can take your time not a little bit take your time you can log in your screen is not usable it's fine Yeah question is is it visible to you the question Maximus toys yeah so I think you can just zoom out to the question part you can just Control Plus and then we can get this problem yeah for sure so let me explain you this problem so the problem is very the problem is like that we are given with an array of length n constricting of cost of n twice so there's a array of length which contain some cost of n twice and then it is okay so you have basically K rupees and you went to a shop they went where there are n items or n twice galaxies and you have to buy that items from the cost means from that K rupees you have to buy as much as items you can and you want to buy the maximum items maximum what you can buy so so what can be the maximum item that you can buy with that km you can you will see that you can see that first test case it is n is seven means there are seven items and the price of that seven items given to you one twelve five with one eleven two hundred thousand and ten and K is fifty so you can see that you can buy item rupee of One Price one of price five of price ten of price point okay that was some up to less than equal to 50. there are the four maximum items that you can buy you can see this thing is the problem here again from that K rupees that is what the problem is okay okay so basically you have to maximize the number of tools that I can get that I can get from this key rupees right okay yeah number of items that you can get from this okay foreign [Music] I should take the choice with minimum cost so that I can get more and more toys right I'm just kind of thinking like really it yes I think so okay so whatever you guys think is like let's say if this given array is 1 12 5 11 the given task is right input one so what I will first do is I will just take the minimum one that is one so you founded the element that is minimum in the cost and is also contributed to the answer also right so I will take one after that I will take five both of them will contribute only six to the price and I've got two items then I will take 10 okay so X less than 16 and I have founded three items and after the next plate is 10 12 and 16 plus 28 so in 28 I have found four items after that I will try to find how many number of elements I can find for how many number of elements I can just take some less than k okay yeah quickly code that problem too just make control minus and yeah it will be great foreign foreign it should work fine mixing okay yeah let's submit it for some okay yeah it got great great travel so I think that we can move towards the next problem this was very quick amazing so yeah you can just open a seat and I have already added the third problem for you so this is the third problem and which is nothing but we are given with a Boolean array a 2d array actually a billion 2D array uh where each row is salted so Boolean image zero one zero one zero one each row is salted okay row by salted Matrix you can see it you have to find the root with the maximum number of ones the row which contains the maximum ones you can see one thing that the first row is containing three ones second is current two third is continue two so first row is one which is containing a maximum number of ones and that is what you have to find that which is row number is basically containing that maximum number of ones okay so what I'm thinking is the first of all that is coming to my mind is I will decide to work all the all the rows and for each or I can count number of ones like just reading iterating right let's say I did for first row I will get count uh counter number of ones is three and row number is zero then in the next one find count is two Which is less than three then it doesn't make sense to consider it then in next two I will find again counter number of months is 2 Which is less than three so it doesn't make sense so I will just output 0. well I have a down like if let's say all the three rows have three ones okay so you can you can output any one of that anyone of that okay so without putting the first one that is coming yeah yeah the faster process is coming yeah yeah like should I code it or should I so the approach which you are saying now so yeah I thought that over all the rows [Music] yeah the number of ones yeah yeah uh so what will be the expected time complexity for it for the approach which you are thinking I will have to edit all the elements of the Matrix a bit that will be of n into n that will be go of n into M okay okay okay uh okay uh you can code it too and if you if you want time to think more about it for a more optimized approach you can do that also otherwise you can do this one sec each row is sorted that is The Salted part if there is salted means if they are saying you because you are thinking can be applicable in unsorted also because if they are saying that salted in each row I will try to find the first occurrence of one okay let's say if if in this case the first occurrence of one is at index one and row size is four so four minus 1 is 3 so we can go to counter once in this way also so we're finding the first index I can use binary search n in the log of M sorry so yeah got it time complexity feature will be converted to log of M and there are n rows so time compressive videos to Big of n into log n that is yeah am I clear yeah yeah you are your absolutely right you can you can try that you can like that I run for it just make a dragon for it and then if the time will say well also code it okay no worries okay so for Dragon we will first come to row number zero like if if you think in terms of indices so when you come to rule number zero find the first occurrence of one that will that result index one so row size is four four minus one is three so we have come got the count of number of ones that is three then we will move two so we will have a variable that is count of one's and in which we will initialize it by the number of rows number of ones in the rows so that will be initialized to three then and the and I will also have to make a variable answer in which I have to show the row number okay so by iterating over the first row we will get counter number of one count of one says three and row number is zero then we will move to next row that is index one in this we can know the first in first index is at 0 1 2 and number of number of elements as four so four minus 2 is 2 which will give us the number of count of number of ones in this particular okay that is smaller than this let's let's move towards the pseudo code okay that's fine so let's explore our row number like in with row I will be having answered anything and we will have a counter number of ones that we usually press zero over all the rows foreign given area is down so that yeah yeah great and we have to pass just Matrix the row of the Matrix yeah that's it now you can also count yeah for this particular row count will be foreign [Music] count we can just Mark The 100 and um foreign research you are writing a different function okay College yeah you see yeah so you found your middle element like let's say if I take 0 1 1 K7 so low will be zero I will be three you will just come to the middle then 0 plus 3 by 2 will be one if I find one that basically means that the occurrence that I have got for one there might be chances that one is also present in the left side also right yeah yeah so this is this is what I'm trying to this is the way I will try to find the consequencive one so let's say if we find that okay this element is one so there are very much chances that we can find one in the left also so we reduce high equal to minus one and answer it right yeah okay it should work and there are many cases they might be considered answer is minus one because let's say of all the elements are 0 right will not get into this if Loop so in that case if answer is minus one if answer is minus 1 we can just return it in there we can just return in [Music] n if answer is minus 1 we can just return n because that here if we come here Road first occurrency and fan management will be zero right so this is here okay okay got it [Music] can you just check that when we are getting that Matrix of I is equal to 1 where's that condition in in that binary function yeah so there you are writing answer is equal to Mid okay fine and then you are checking for the left side that the plate is present in the left side yeah finals you are getting the right side why you are okay so why we take low plus High minus Low by two but not low plus High by 2. what's the reason for that yeah no basically the difference is not like that there is no difference because if we just solve it this it will also come along plus High by two only if we don't don't take care of the floor in the integer division type of thing the reason that I take care is like let's say if I take low plus High is a maximum okay so it will reach the it will go across the bound of the integer because like the integer ranges increase the maximum only right so if I make two integer that increase maximum add then it will not like come into integer down it will exceed that yeah that's why because yeah yeah great great so this is this is the actual reason is actually that uh for for you guys for the viewers also that why we not take that because if we will take uh low plus High bar too so it may give the uh over over bound error that the overflow will be there if let's say that let's say let's say example key your low is 50 and your high is 60. and let's take a case key we can't take numbers more than 100 in the uh in integer let's say there is a data type where we can't take numbers of model value hundred and we have a value 50 we have available to 60. so when will you find the sum of it it will be 110 that cannot be stored but eventually if you will see one thing that if you you will find the mid of it using this technique it will be 50 plus 10 by 255 so it will not overflow the uh actually the range okay sorry I also want to add something like yeah both these things are grammatic mathematically correct only it's just the difference that we should not get divorce to error that's why I like we are doing like yeah if you solve this if you will just solve this that bracket that is high by two minus Low by 2 will be there and if you will make it low plus low minus Low by two it will eventually High plus low back to only it is and the answer the value everything is actually saving not diff different so that's the thing okay great yeah great so I think okay so I just wanted to check this code if it's correct or not it is not so clearly visible in this so let me share with the link also so that you can paste that same code there only so that I can it will be easily accessible okay okay I'm adding the link in the chat in here only just have below you have so yeah I have shared a link just copy the code that you have written there no no that's it only that's it and that's it let's try it but whatever you have written foreign but I need [Music] some function this is a tab I think it will be fine and then you can submit it if let's say there are no rules then what I should return the answer and I think that you have to return the roll number which has the maximum not the maximum uh ones the row number which contains the maximum okay I think that will have done that or not yeah I'm saying that you have to return that row number which contains the maximum fine yeah is it right I think it is working yeah you can you can maximize that output window actually we are not able to see it no that have proven that that maximum yeah okay great you cannot submit it please maximize it please maximize it okay so for the case when there is only one row it is giving the wrong answer I think yeah yeah so you are you have initialized your row with minus one if you will see that Max one's function uh just scroll down you have initialized your row with minus one and you are saying that when the row count will be greater than the count uh it will be increased I think it's it's fine I think it's fine yeah so the problem first appearance [Music] as you can you can go for it the guys anyone who is able to check the jaberges I think it should be working fine um Supply I think it should be n rules I think it should work in my opinion right yeah is it the same case another case okay again just try and for this case foreign your your binary function is working fine there you are writing it 2 is equal to I and then you are written that row what was there is it is [Music] we will not be able to see it again let's just maximize the window it's working actually that one actually the thing is important that you have to tell like in the first row that was yeah so I just thought yeah I I had done the same code again like it just no no you have you have to move that equal to sign up from that that line number 36. it was like that you have to tell the first one yeah it's fine it's fine that was a very basic well it's great guys Okay so fine fine I am just unsetting your screen it's great from uh my site so yeah anything back like for me yeah yeah we are now now let's move towards the feedback session guys so yeah all the uh all the top all the questions which I've asked you the first one like which was based on the this thing actually I was expecting the the same uh answer actually just a minute I'm expecting that you will come up with that order of n plus and approach only um quite confused with it that uh will there be any optimized approach or not so yeah that's correct that that absolutely fine and also for the for the second second problem you solved in I think in less than five minutes so it's it's a amazing and for the third one again uh yeah you just come up with that binary solution which was the actual solution for it uh so it's it's also fine if I will uh if I will tell you about the some things uh from my side for a first problem it should be obvious that whenever you are you have to take a check for a particular character so always go with some Hastings techniques that yeah there's no need to just iterate for that again and again so that is what I think you missed in the first problem and that that mistake I think more than half an I think half an hour for the first problem and that that was a quite negative negative response after that it wasn't it was good that the second problem you you just solved in a good time and for a third also you solved with an amazing time and we have also coded it both the last two problems so it's completely fine from my side now uh open that seat I have say I have it there only open that seat yeah if you will just scroll down yeah so for the coding and I implementation skills it's fine means how you are coding how you were implementing the things it was great and even I can give you 9 out of 10 for implementation because yeah my implementation was quite good and you you basically know how how we are implementing and how we are doing things uh for implementing means how you are and why I am focusing on that that implementation Parts because sometimes we know the logic but the implementation is not so good but the thing you the the way you implemented that binary code also the way you implement the math and also that small question which I just asked you in between just like why you we use another map not the map and uh why we take that uh high low that thing High Low by two or high plus so that is a some basic question which I just asked you to check that uh are you basically or not and that was you you were passed in that so that was again a good thing uh for problem solving thing uh the for the first problem there was a quite negative response because you took some time after giving my Hindi you can solve it in our most effective way and I think that uh that time was what was not required means you should directly tell that approach because that was a quite problem which is uh Direct Auto passing and that's all otherwise the next two columns your schedule date and I was supposed to write this two problems because but because you solve the second problem is just less time so I just taken 50002 and foreign talking to me or you are not telling just just think loud actually now whenever you are thinking for approach whenever you are whenever you are coding just like you take in a variable row you take another variable column row and it's like so you can either add commands or you can just communicate with me in in a real time but yeah I am taking this and why I'm taking this I am taking this loop I am taking this condition what what so it it's fine that after writing the code you explain me and everything but while writing it was like uh two three minute of uh Gap was a connection that a break so that should not be there means you should think about whatever you are thinking if it isn't good good way uh if you can say that to the interview you can surely see it because it should not be like an interviewer should feel uh his writing and give it time yeah there were more feedback but when you will not interact with the interviewer and you will just write so interview will feel that yeah you are taking much time to write a code because he's just sitting and watching your your solution but if you are just interacting with the interviewer just asking the questions from you know just telling your approach so that interview is just trying his efforts and is getting so yeah so that that was the feedback from I said uh otherwise I will give it a overall so overall can be eight hours out of ten if it is a good good a good performance okay and uh so yeah I think that you should just work on that communication part and for problem solving uh just that thing that uh just try to come up with the efficient one first okay it's fine that first of all we have to go with it I just uh I came up with the efficient only but I think like you you yeah like the seniors that uh that we have like they always told that let's start with the Brute Force only and then you should optimize the problems so that's why it's coming from the group was only because like I was getting like yeah no you have to start the Brute Force but a real thing is that you don't have to invest much time on protocols that is the actual thing now you don't have to invest much time on Workforce the reason being is okay yeah okay so the reason being is that if you will invest much time on Brute Force the interviewer will think it may be negatively that you maybe don't know the efficient one okay it's just like it you can just tell them and then you just come up with a solution that yeah this is the efficient part otherwise if you will invest more time let's say that there is a one hour interview and if you have just invested your 15 minutes in writing the Brute Force code so it will be a waste of time for you now that you have just missed the time that you will have to take for the efficient approach so it's fine come up with come up with a good uh with a good Force first then optimize it but not take much time to explain write the code of the group okay complete code for the brute force that was not required because what uh what time and interviews is expecting is a efficient solution from you so it's fine tell the beautiful truth and then come up with a efficient solution let's start attack that yes sir let's see if even interviews saying you that code The Brute Force then also if you have a prisoner who just asking him or her that sir uh I have a question for uh approach can I tell that can I Implement that so obviously he or she will ask you that okay so that's the thing actually so yeah it's it's amazing there was some uh some more things like that you have in a slice that index with minus one and something like that that's a very very quiet uh mistake that version otherwise the basic parts of the fundamentals like that another map map and that that binary search that the basics are clear to you I think and that's all from my side uh overall it was amazing experience uh interview how was it for from your side same as a great book yeah yeah great so if you want to ask something from me you can certainly ask so how has your experience changed from like from being a coder in college like to working in some company like how has that experience changed because in college we are just solving DSA problems but like in companies that is IR work two months in a company has entered like things are pretty different because yeah exactly it's like that in in college we are just about the theoretical things just attending the lab just attending a classes it's more about uh theoretical things okay but when you will enter in a company when you will work for someone will when you will work in a company you got a chance to implement the thing that you have learned for example if I am here at least four gigs I am using my knowledge of the essay uh okay for different tasks and if if I'm doing a SD internet at somewhere so I'm using the knowledge of development that I have learned so it's basically the the Gap is something that in college we are just more about the critical path whereas going live where does writing a bubble sort algorithm program and but eventually in the real time in the company you are using that in the uh live project so that was a different I think and that is a very great uh I think the way how you can boost your knowledge how you can make your skills more clear yeah yeah so that was yeah anything else so you are not even yeah anything else out I'm asking anything you want to ask okay great guys so it was great interviewing you Rahul all the best for you for the future interviews for upcoming interviews for you and all of us guys if you also want to be the part of these type of for these type of interviews you can just fill out the form which is given description and you can also get a chance to be here with us in this Geeks for geeks YouTube channel so okay guys okay Raul thank you thank you very much yeah guys so finally we are here to come to the session so fine guys I hope that you have learned this particular session repeat the process go yeah exactly you are you are right multi you are right and I think that many of you are participate in this interview uh greatly and you you all have also come up with a great solution which was the efficient one so great guys let's meet in the next live soon in this channel until then Happy Gooding take care bye bye thank you