Github Copilot DESTROYS Leetcode Coding Challenges | How to Properly use Copilot in Interviews

Key Takeaways

hi everyone in this video we're going to see the power of GitHub co-pilot and we're going to take a look if co-pilot is actually capable of crushing your coding interview and crushing the coding problems on lead code yes you're here right I'm going to take co-pilot and we actually going to give it some test and go through like real word interviews or real word coding problems and see if actually if copile is basically capable of solving these problems with that much of assistance from us without basically taking a look or actually solving it by ourselves we can just like hand it to co-pilot and see if it's actually capable of doing this it if capable like if is it co-pilot that really powerful AI tool that is going to just like take our hands off and just going to make us win Cod interviews from now on maybe who knows copal is actually a really really powerful G to or ai2 developed by gith hum and it's actually been released like I think a month ago and I got my hands on about like 20 days ago and I've been just like putting in a test all the time and seeing if it's actually worth it and if the hype is actually worth it about copile and yes you're here right copil is an awesome too literally just like haven't thought it there will be a tool like this but yes open Ai and get made it possible still actually need a beta still actually a preview and it's technical preview in here with some bugs the flows here and there it's already okay but what it can actually provide you and actually assist you throughout as a developer it's mental it's actually tremendous and it can give you a huge help it can it can just like you don't need ever to go like to search for a specific problems like how to how to sort an array Us in JavaScript or how to reverse that or how to define that or whatever the kind of thing you want to like go and Google out and check out stock overflow no stock overflow again you can just use GitHub copala because it literally is makes a lot of sense and of course we're going to put this into the test and you can just go to lead code and pretty much we can see if this can actually crash the coding interviews and problems and can actually use it all throughout the code editors and see if it worth it and of course we're going to test in on real word problems and see if copilot basically can just like take a word just just take regular words like regular English regular instructions and turn it into a real word working code that can be provided through an interview and solve the problem let's see go and basically let's go and jump if to see if that's [Music] possible so before jumping into the real code and real problem solving actually there's actually this huge question that's being Hur around which is will ever AI take our jobs as developers like as me and you as developers coders programmers whatever you want to call them will ever an AI tool like copil be able to basically take our jobs and leave us homeless or something it's it's a philosophical kind of question I know that's that's completely kind of different but so many people get goes and ask this question and in my opinion and I think what a lot of people agrees on this like developers of stuff I mean this is this is like it won't happen in the near future and I don't think it will be able and it will be very hard to happen like in a different circumstances but it will be very hard to happen in in basically in the far future uh if if to be say but this this kind of question is very hard to actually have an answer for it and I would say in my opinion copil right now is an awesome too it's very powerful it knows a lot of stuff it has millions of lines of cod that has learned from it there's a huge neuron Network goes behind the scenes and empowers the actual co-pilot engine and the botel all of Z stuff but still it lacks a lot of stuff it doesn't think like human it doesn't have a brain to think like a human on how to code when instruction comes first and all stuff it doesn't only know code and how to insert code when you actually tell it J your code still yes very powerful very very powerful but still there's some huge flaws that needs human interaction in order to be able to complete his job without the human interaction it won't be able to do that and it would be very very hard like very impossible uh to do that and by itself without any kind of like external human interaction and guiding it or having like a developer guiding through that and basically doing it or basically for now it's just only a tool that assist developers to write better code without looking into the documentation much this is this is basically the the main point why copile or GitHub copile exists anyway and most importantly is actually to make you a better programmer and of course solve problems faster so we can code faster and we can get features done faster and it can develop faster that's the point that's the whole point why GitHub C pilot exist just want to just go through this question real quick but anyway so let's go and jump and see if we can crash the first um kind of you know problem in here and I want to go like with a simple problem to a very hard problem and see if co-pilot basically can take that from bleed codes perspective and of course problems are all in bleed code I'm going to go from like easy to hard and all sort of stuff and see if like is it capable will copilot be able to assist us will copilot be able to generate this let's go ahead and see I want to start with a simple problem I'm pretty sure a lot of you knows that a lot of you have been through like assessments or interview questions about this particular problem which is binary trees or traversing a binary tree so what I want to go here is like traversing binary tree and it can see here like binary tree in order transversal or pre-order or postorder you see like the in order is basically the most kind of common one that has been you know 67% so I'm going to go with this of course they are all easy so we can see if this easy problem is like well copile and be able and basically how long Kai will take to basically figure out the the actual solution for this one as clear see this is the JavaScript solution we all know that this is what binary treats either have a left or right for those of you who are not familiar with so there's actually a node and each node has at most uh two child one is right and the other one is left and each node of course can have a value and have another one so this is basically how it looks like uh this is a tree node it has either value so it's like a number 2 3 1 whatever and it has left and right and these left and right you can think of them as pointers or other trees so left can be another tree and right can be another tree and it goes on and on and on and endless so that's that's basically where it is and here what they want us to do or what I mean by binary tree Trav so it's actually you've got a binary tree and you need to like go through the binary tree for example you start from one you read one you you print the value like this one you go like two you print this two and you print three and all that sort of stuff so this is what the output for example you give it this input like one then no no basically because this is this is empty and you go through this and of course there's actually The Roots one in here it just prints nothing and all that sort of stuff so that's basically that's basically the point in here what I'm trying to say uh look how to visualize that and everything so we can go ahead and breathe through this and see if this is actually capable of how Co copilot basically can take this from our hands and how can be done or basically figure out a solution for this as quick as possible so I can go and copy this one I can copy this exact one in here and I can go to the visual scill code in here we got already like a project setup and everything and this project in here is have some setup going like typescript with nodejs so you can run JavaScript nodejs or typescript NOS so we can I can basically preview both and test co-pilot on both uh kind of like langages so we see if you can generate both of these codes perfectly without any issues so clu here we got the first file which is the binary ch. JavaScript and I want to generate this bino so let me just go and paste this one we got inorder traversal uh we got a definition of um basic binary tree in here so I want to remove uh comment of this I don't know why V code is not recognizing this but we can get rid of these comments real quick in here and I need that so this is what a tree now this is just a Constructor for constructing a tree node and this is what going to be like basically passed through this one so if you look into this scly I just put the cursor in here and I got co-pilot activated clearly see in here I got the preview and everything so this one is activated with vs code and as soon as I open up this function so this function has a pretty good name right it has in order traversal and it already does have um kind of like what I would say this it's it's basically uh like the value it has has like this tree notes so it has the code structure of how or the data structure actually already kind of like initialized for us so it already actually popped up something for us it already gave us a solution or a suggestion at least I won't say this is a complete solution because I don't know if it's complete solution but an order traversal yes it looks like an order traversal and here returns a result so it returns like a a number array so this this looks like it's doing it right so all you need to do to accept this you just click the tab one because this suggestion of course here copile gives you this suggestion so you can click next or to see the next solution you can go alt um then plus the other one or you can go previous alt play the Open brackets then you accept you click tab or you can click control enter to see like uh I think 10 different solutions that you can choose from but anyway so let's go and accept this one and see if it does work so tab we got this one accepted and let's go ahead and try to run this one here luckily and see what it does so I'm going to use console log and binary I can just put tree in here and I can do um in order traversal and here as clearly you already give us some suggestion so it already constructs a tree for us clearly there is a tree now me just get rid of this so there's always a tree node like constructing a tree node inside of another tree node and and goes and on and on and on but let's go and see what lead code does have for us as an example so we can we can have a point with so it's 1 n 2 and three um so I would rather what I can do in here is actually copy the code so I don't want to just go into the details and writing all of that because I want to make the video as quick as possible so we can copy this one we can give it to Le code and we can go and run the code to see and check if this is a valuable solution and it looks like it is right it's just like this is the outut this is the expected output and he traverses this he goes to one he goes to two and it goes to three that's the actual output from the example let's go and provide it with an empty array and I want to provide it with another array which is has one so let going to run this one again and this is has been generated by co-pilot in let's say a second it was less than a second it was half a second it was like I don't know 400 millisecond it's ridiculously fast but it got the job done and it seems to be working at least with these kind of previews so what I can do I can provide other examples I don't know I'm not sure what these examples are going to have because um lead code is going to basically give us how this looks like by the tree visualizer in here but I'm just going to put some random values in here and try to check if those are good values and let's go ahead I'm going to put a ridiculously Long Tree in here just to give it a test and this is this is how our tree looks like right and if you're familiar with an order Trev so he just basically goes from the left then he goes and visits basically the the root now then he goes and visits the other right kind of tree so you would see it the same way we did before in here uh like for example for the one we did go one then we go two because that's the rise and it goes to like three or something or yeah sorry it goes one then it goes three because this is like the the leftmost tree then it goes to two so you'll probably know uh more about this binary issues but I just want to go and solve it so let's go and run the code and let's see if this is actually capable hey copilot are you capable yes I am and there you go you got the output and yes this is accepted and your run time is 79 milliseconds that's crazy right I can copy this for one last time and it can add as many as I want I can I'm going to go crazy about this and test this to the bones and see if this is this is capable remember this is this is just an easy problem so co-pilot you know it's just made it a little bit easier for co-pilot to generate so it's not the hardest problem that co-pilot can solve so that's why I gave USS very quick we didn't have any issues uh solving it but I'm going to go through this so 2 5 6 10 2 2 1 five 10 or 18 no yes that's enough I don't want to go too ridiculous so let's run the code for one last time before we submit the code and yes it is accepted there you go look at it this is long huge and 85 milliseconds awesome right so let's go ahead and submit the code and this one is going to run it through you know tons of different tests and there you go we got 79 milliseconds which is faster than 54% of submissions how does that look like with co-pilot um I'm personally amazed yes it's literally awesome and the run time like the run time is ridiculous 79 MCS I'm fan with this and a memory usage good enough with the JavaScript awesome I don't know I'm speechless but yes co-pilot did that and look at the code it's pretty tidy pretty simple to read if you go read through this you can you can easily read it this is a result this is a stack it has a clean code I won't lie this is a clean code and it did give us all of this and he took advantage of the tree node we initialized here and of course using the help of these comments which we just copied from the lead code and pasted in here it did the job for us awesome so the first test is passed successfully throughout the co-pilot so I'm going to give it 10 by 10 on the first test on the first binary tree traversal in order traversal test cool co-pilot now let's go ahead and give co-pilot a little bit more harder test and we're going to go with this median of T array or sorted areas um which is just like gives you the median which is um you know the the middle of these two rays and of course in a sorted manner so they are already sorted array so it just doesn't have to do a lot of overhead I guess and it just needs to gives you the median and of course the complexity right time should go with o log of M plus n which is the size of two array if they have the same size it's going to be like a log of n which is a pretty pretty decent runtime complexity compared to the algorithm actually run in so let's go ahead and see if basically copile is basically is capable of generating this and or giving us a good enough solution that can fix this problem just you know solve the problem of the median of two sort of arrays so what I'm going to do again I'm going to copy this one I'm going to back here and I got here like another file which is the array Med in so I'm going to paste this one and as clearly see we already got everything in here so as we did before let me go ahead and get rid the function in here and just like let's say we already like you know created the function we open up the brackets and Hallelujah just like uh let's say a second copilot gives us this it finds it like a good enough solution right so if I click tab uh that solution should be accepted but there is one flow about this solution look at this there is this function that is you know doesn't exist in here it should exist but it doesn't exist in here and co-pilot thinks that is a good solution which if you run this one it's going to throw us an error say oh find key Keith yeah I'm going to say find keyth is not defined or you know has been defined or something which is an a throwable error which is a bad one and copad didn't good do a good job from a first catch in here so if you take a look again if you use the alt plus the close bracket to just to cycle between the different solutions that he's capable of doing you might find another solution and this might be a good solution why not because it returns that it returns a number and this is what we expect to return it takes a nums one nums two both are number arrays of integers maybe this is good but let's go ahead and just like not gamble about this yet and let's go ahead and try one more time there is actually a better way to describe like what you want to do to co-pilot just to give you the best chance to give you the best result you could you know possibly get and to do that you basically need to use the comment section because that's how copilot basically Works use the comments use this this place of comments in here to use verbal English to just describe the actual problem and what the solution is so copil can use the Nur work go grab and take a look in some millions of lines of care throughout the GitHub repositories and all that sort of stuff and come back with a solution maybe that solution will fit better than just this one because right now what copal is basically using is just using this kind of name of of an function and tries to go and look for a solution for that which is not very descriptive if you want to make this a little bit more better you can write a better function name that is more descriptive but that could be a little bit ugly because you don't want this very big ugly function names right so I was going to try to do this and what I'm gonna try specifically just to make it much more you know sweet and and a little bit better in gambling so I can go and copy the SE same text that lead code provided us so we don't have to like get something from our head or something I'm going to completely replace this by the way so I'm going to just copy paste this one and I'm going to save so this this one way says given two sorted arrays nums one and nums two respectively return the median of the two sorted arrays and that's that's it I guess yeah so that's that's the whole thing let me just create an another one now I can make a little bit of more description and I can make this what I can say for example I can say um those two sorting medians which is can be um I don't know return this two sorted medians uh the two median of the two sorted arrays as a number okay just give it a more description that the return type of this function should be a number right that could be cool let's go and take a look if if that is going to do a good job so we're just going to make or give some time to co-pilot maybe it can get us a good solution and I don't know this is um this looks like a good solution right it does look for me so I'm going to just go ahead and accept this one so I'm going to use tab I'm going to accept this one and this is this is looking like this is doing a good solution and there is actually this is the second thing that's when I said that co-pilot AI kind of tools won't take our jobs as developers because here as a developer you need to basically take a look on the code just just a quick glance on the code and seeing oh what the code is doing if that code is even right if that code is even going to fit for that particular problem or not and as far as my understanding here is actually doing some f while Loops to loop on both arrays and doing our results because I already know the solution for this or problem it looks like this is a good solution I don't know but let's go and give it a test and see if if that's going to print a good solution so I'm going to copy this one that I did give it in here I'm going to go back to Google Chrome and I'm going to just like paste this one as simple as that and I'm going to open up and run the code and there is actually a couple of test cases which is the the already examples we got in here and Hallelujah we got some ridiculous I don't know what but this is uh looks nums one nums to it looks like inde defined it returns inde defined for the output I don't know why that is return and defined but that seems to return and defined for some ridiculous reason so um yeah absolutely no idea but so expected or should return a number but it doesn't return a number but um let's go ahead and run this luckily and see if that's actually going to return any kind of number for us so I'm going to do console log and find medium of two sort arrays I'm not sure what the exact problem we got so it's 13 which is um the numbers one 13 and the second is two so I'm going to do this one right here and see if it's going to or this is 13 right this should end up like this so I'm going to run this using node and I'm going to use where is that array median do um JavaScript and that's yeah that's indeed returning inde defined I'm not sure why this is returning inde defined but that doesn't seem like a a really good structure um or a really good kind of solution for us so in my perspective in here copilot failed from the first result so you might go ahead and edit this function because I'm pretty sure this function is is good enough actually to go for fixing this problem but still there's some modification maybe some some flow goes right into this that is you know making it a low or return and defined so you can go and edit this but what you can find much better is actually go ahead and look for a better solution so you can just let coil do the job and basically use the alt and just like you can go through different solutions I don't know um I'm going to try a little bit kind of a different solution than this one maybe this recursive one will work I don't know let's go ah and just like save this one because it just like it calls this recursively it looks cool uh run it and we get in defined again so this is um this is really not cool uh let's go ahead and keep looking so where is this this is not it we don't want this we don't want that um let's go ahead and take a look on this okay not not this I think I can is this it or is it no no no no not this one maybe this one let's try it out we get two okay so if you get to and this is two so let's go ahead and copy this code this is looking like a good solution just by traversing through and seeing different solutions and trying them okay and SC in here I'm not even going through the code reading or even minding of reading the code because I just like I'm trying different examples to see if that is actually returning a good one then go into lead code and paste the code and see if that's going to like you know provide you with some kind of like examples or test cases and see if that is actually going to do any good job or return any successful uh results that's going to match and yes this is one accepted right this this looks cool so let's give it another test case in here for example I'm going to give it this one two that is with a with a three and four okay and let's go and run this one so I'm going to do run codee again and this one should yield or print 2.5 and this is this is indeed which earning that I'm going to try the other one which is zero always always for this copilot because you don't write the code even though when you write the code so you can think of yourself as writing the code and now you're taking this code and actually putting into the test and passing it through different you know test kind of values to see if that is actually going to match and this is a good enough algorithm that's going to you know solve this particular problem and be valid problem or a valid solution so I'm going to run this z0 should be zero because that's the median right that should be good enough and that's zero and the last one we should two arras we should return one because the other one is empty and the other one is just one and let's go and run this one again this's the fifth one which is the same thing in here so I'm going to try another one from my hand in here just uh something ridiculous 10 5 2 5 10 20 uh 5 2 4 22 33 okay going to run the code in here and see if that's going to yield any any good one uh bu be no yeah this should be sorted array sorry this just should be a sorted array totally because screws in here all of these are sorted AR raise so um I can 5 10 20 30 maybe 1 5 [Music] 10 20 30 50 60 I know that's ridiculous going through this but I'm just going to run it through this one hopefully if it passes yes it does now I'm going to go in and submit the code immediately and see if that shouldn't going to do any good job and yes there you go you got that in 160 milliseconds which is faster than 90% of JavaScript application submissions on that particular problem if you take a look on the number of submissions this is ridiculous the number of submissions at 3 million and only got 1 million accepted and we got ourselves 90% faster we didn't even code it by ourselves it was all being done by co-pilot but as clearly see copilot didn't figure it out from the first try so we it tried to do that but it needed some guidance for us so it needed a real world developer to come through and say oh you're going to need some guidance to you know solve this problem or you need to just take this algorithm that is being produced by co-pilot and put it into the test and you know pass this couple of values to see if this is like a valid solution or not and you can take a look another solution sometimes what you need to do is basically go through the code if the code is it looks valid somehow but it has some flow that is not returning right so you can get go ahead and it the kill so you need some decent knowledge in order to do that so it's just like not always going to work for you 100% but I guaranteed co-pilot can one way or another figure out a way to give you an astonishing solution that I can use it for coding interview and yes response to your question yes it can win you your coding interview and it can help you a lot I'm not I'm not saying you can or you need to go in and use copot to cheat on interviews none of that I'm just saying it could help you and you can learn from it but yes this is possible and this is this is really fun so we got another last test which is the third one in a row in here and this is actually another leak code problem which is the reverse nodes in a key Group which is just a graph so for example you got a graph in here which 1 2 3 4 5 you basically you give it like a k you say oh I want K to be three so it goes to the third index in here and it revers it so it becomes 3 two one then the other is still the same which is four five so they got they got those kind of you know indexes uh reverse so that's basically the algorithm in here and as you see we're going to just like solve this using python so we're not going to always stick to the old Java script that we always do since basically GitHub copile is actually supportive of different languages like a huge set of languages and more particularly which is so powerful on and it's actually basically JavaScript typescript there is go and and there is I think Ruby and the other good one is Python and that's what I'm going to the test which is the python version 3 and this is this is basically what the solution is so we're going to try to copy this one as we did before and we put it into the test and see if this is if this is actually cable so I'm going to just like contrl C I'm going to copy this one I already got some decent uh python 3.9 is cing 3.9.5 already running so we can go ahead and put in test and see if that so going to run and if copad is basically going to give us any good solutions from this particular part in a quick way so we already got this one so let me just going to incom these uh I don't know why this is auto incom not working but uh let me just get rid of that and that's already there of course indentation in Python it can kill you or save the day for you so whatever you want to you want to think of it but there here you go so this is the least node or the list node and which of course has a value and it has an next so you can think of this as a link list or you can think of it as a graph I would rather think of this as a length list so this is a link list problem and the solution here we need to reverses that before the K in in here it could be three or something so we can take the first three indexes and reverse them back and leave the others alone without any reversing so the solution is already a class I don't like classes I would rather solve it in a particular kind of you know way of function so that's much better for copilot to understand what we doing so always make sure you just like put it as a singlehanded function and let copile do the job then you can copy the Cod produced by copad and of course integrate somehow into your code if you're using classes or different scenarios so that's what I'm trying to do in here I don't need self cuz that's not a class anymore and C in here we got the list down here being returned for us and everything we got this one is and ins if you're not fam with Python 3 or I think 3.5 they introduced the list or the typings hint so now you can put ends and you can put actual time pins which is absolutely awesome I'm loving this feature on Python and it makes the code much much more cleaner to write code in Python more particularly but anyway so that's what we need in here we already Define this so let's see if this going to give us any kind of hint from co-pilot so I'm going to basically remove this one I'm going to rewrite it so sometimes you need to do that for co-pilot to basically understand what you're actually doing so I'm going to do like list n and this is what it's going to return and as clear in here already gave us we already gave us this this good kind of code that looks that looks pretty decent actually it won't lie to you um so this this looks had is none return hand I don't know this looks good I'm just going to go ahead and put it to the test I'm going to accept this solution why not this looks pretty good but since this is actually a list node and of course a list node is not an array or not a list on python so you can't print it you can't see actual action so what I can do ising the help of copilot again we can tell copile oh we need another fraction we don't know how to Traverse a link list and we don't know how to Traverse it and basically print the values of the whole links list how can we do that and co-pilot is going to answer yeah that's easy I know I'm I'm a huge stuck overflow I'm a million lines of c and it can help assist you through this and to do that I can put for example to find I can do like friends do what there you go it just gave us the solution that's crazy I wasn't even anticipating this and there you go co-pilot gave us the solution without ever knowing about this and I just like I did print and he already knew the actual context I was working with that's amazing and that's one of the amazing features I like about copilot it does take consideration as of the context you're actually working in so if you're working with different huge files that has different variables and all stuff it knows what you're working with it knows the different variable names it knows the different functions and it's going to suggest you alongside the functions it's amazing there you go so we got the print list in here and this going to help usly already takes a list nde it's going to help us print a single list n and see how that does so let's go and test this one I'm going to for example create a this s in here and I'm going to create um let's go ahead and I I don't want to do this maybe that works I'm not a a basic python fan but I'm going to create a blist down here for example I'm going to say one and it's going to have another list n is going to take two and basically just a Shain or a chain of list node uh so list node that's going to be I think there's four and five so I can use the help of this I don't need I don't need those okay those are not needed yeah I don't know why those are not being deleted okay so we can we can close the parentheses in here there you go so we got that that and what I can do is print list I think what is the print list okay let's print list and we just give it the ls in here and that's not only it we need to of course run the function which is the reverse key group then the reverse key group will give it LS and for example I want to reverse from two but let's see what the actual lead code is basically provided as a problem so here for this one it refers as keyer so it starts from zero of course this is a array list so this is what it does so let me go go ahead and actually run this and see if that works if see if the co-pilot solution works so I'm going to do Python 3 reverse nodes. pi and can open a file no such file directory reverse noes. pi and um it looks okay so we got one then two then three then four then five so two 2 1 4 3 5 I'm not sure why 3 is here maybe because I missed that but anyway so let me just to make sure that this is a good solution or not I'm going to completely copy this this solution that is being provided by copilot I'm going to go down here have some indentation to it and I'm going to completely paste this one and of course go um it was going to need some indentation so I'm going to going to run the code and see how it does okay so an indent does not match an alra indentation uh so this is an f and this is another F yeah it's ugly to indent the actual python code there's always a you know a bin of the ass but where is this next reverse the key group yeah so this is just basically going to do um so we need to use self reverse group because before we didn't use or run it on a on a class so that's what I meant by doing some modification but still there you go it's it's actually converting that and it's actually doing it pretty good uh it's actually being out as expected as it is and everything so that looks that looks pretty sweet maybe we can just going and copy this one again and test this one with a three and see if that is actually going to pass that maybe what do you think guys accepted and as you clearly see for the actual code in here we didn't take much we just like created the function we put the cursor there and co-pilot did the job it took basically 2 seconds if I remember right but that was so fast that was blazingly fast and it did the job and it got it right from the first time we didn't need to do any any kind of special treatments and if I submit the code This Is The Moment of Truth to see if if if that test is going to pass and yes indeed is going to pass and it's like 52 milliseconds which is faster than 49% that's mental using the Python 3 I mean that's crazy and co-pilot did it again and he saved the day for us so my final thoughts on a co-pilot if you are thinking about coil oh that's ugly that's going to make you a bad developer it's going to make you a really not productive developer that's not right so you can you can choose to use it yes or no and sometimes it gives you a really good Solutions I chose or I use it in a big production project that you know use it like a huge kind of project that works millions or like I say tens of thousands of lines of code and it wasn't even lagging it was always performing enough it was always suggesting what I what I actually was expecting and it was always good whenever I need a function I don't need to go to like stock overflow and spend like two minutes looking for a solution where copal can give me the best solution and it can you know swap different solutions and I can choose the solution and say yeah you can go with this one that's super good I like it I absolutely admire this and there's of course some issues I'm going to say several issues around this and needs to be fixed because this is a preview and a lot of people have been like you know contributing to this and providing feedback so that's pretty awesome that's that's pretty promising that actually copil is going to improve Pro a lot and the next version or the official version is going to be 100% much better than this one where already this one is crashing it as clearly see it crashed the lead code problems and we got three lead code problems already solved only by co-pilot by the GitHub co-pilot we didn't need our brain or our knowledge to do that anyone can do that right so anyway guys thank you guys for watching I really hope you guys enjoyed this video that was was a kind of a long video compared to other videos doing this co-pilot thing kind of review but honestly what I like to do myself is actually go take a tool or take something a framework a tool a library whatever and just like go a little bit deeper into it and understand the actual outcomes of using this and how to use it properly and actually testing a real word scenarios like this one on lead code and see if it does actually crash and as clearly see with your own eyes it did and it solved us the problem and that was crazy so without further Ado guys hope you guys enjoyed this one and see you all hopefully in the next ones [Music] [Music] [Music]