I literally spend hours, looking through various videos to try and learn on new things and I never learn as much as I do from your videos man. I really don't know what is is, but the way you explain and teach, there is a simplicity to it that just makes everything click for me. Your channel has helped me so much throughout college and now its helping me prep for my first big interview, I really can't thank you enough man!
I've been looking for an explanation for this for like an hour now, and this video has by far been the easiest to follow along with and understand. Thank you very much.
Which language is best for learning, data structures and algorithms. I'm very good at javascript. & very familiar with java & c. Please somebody HELP ME. as I have to continue with js or java or c.
When I searched about time and space complexity, I saw some very popular channels videos and yours as well in that list. I clicked yours first cuz I trust your knowledge and your way of explaining things is way easier to grasp. Thanks a ton man!
Thanks kyle. Big(O) notation is something I have always got confused from multiple sources. This video is really helped me to understand with simple examples.
Thank you! Web dev simplified has been my teacher since html and CSS! I'm now studying intermediate javascript and CS50 and he's still the guy that is helping me undwrstand everything ❤
your video's help me lot usually I never preferred to watch video's for learning but when I started watching your video its really easy and understandable for me. Your content is very simple and short and understandable Thanks for making this
Now that I think about it, as someone who does have a job, and have interviewed people before these kinds of question are not meant to be passed. at all, they're just a good excuse to have the liberty to pick which people you might like although there's gonna be exception to those who pass. that's a a different story. sure there's interviews that are sometimes have good intention, that's different too. not all companies are the same though, for some companies. these kind of question can be more of a necessity rather than a luxury but as more and more companies conducting these kinds of interview questions. they're become more of an excuse. not to mention if the person asking the questions even knows what they're talking about in terms of these nuance points, not just comparing them to textbook answers sometimes if not a lot the interviewee are as clueless when it comes to these questions and just treating them as basic checkmark. awesome videos btw, I always enjoy your content.
Indeed , in web-dev, where things change every 2-3 years, you dont need any of that computer science maths to execute the demands of your boss/client for his web page or app. In fact, technical question in interviews are meant to see how you would handle talking about technical stuff in group settings were they to hire you : Are you a snob intellectual who likes to flash his technical knowledge in an unpleasant way to other coworkers who are not that nerdy? Hiring people is about good chemistry and personalities! Interviewers are looking for people who will fit with the team's member personalities without big ego clashes!! Conclusion: Dont try too hard to impress you're not impressing anyone just be yourself and be honest about how you'd go about tacking a problem while being positive and joyfull: Boom ! You got the job!
That's not entirely true. It depends on the position of the job. If I'm hiring for a senior developer or an architect, I expect them to know these questions as it's important they can create solutions that are performant and efficient, whether they implement it or not.
Oh man, thank you very much! I was trying to learn alone, but some books about algorithms and data structure think that you have Big O notation previously, and many explanations that I found were so complex.
I'm a graduate student in statistics self learning data structures and algorithms. This is a great example. I'll note that it's also very intuitive from calculus. For any self learners without a STEM background I feel a business calculus textbook (without trigonometry) might be helpful to quickly understand limits
One mistake I realized in the video is @9:53... You said the code written is constant. But it is actually linear. Although the outputs are constant, the code still has to run through the for loop. Which gives the code a Linear time complexity. Other than that you did a great job explaining this lesson. Thanks!
I wished you would have been making Videos when i was in College - you are able to explain things that Took me hours to understand so well, quick and precise, It would have saved me so much time! Nevertheless, I Like watching your Videos even If i think that i know Whats going in just to make sure i keep in touch with different topics and basics :)
you are so good in explaining ...Can you make full playlist on course (data structure and algorithm) with code , because I think its more important to a computer science student (2)
I laughed when you introduced this video by saying "...so you can walk into your next interview...". This does come up in interviews, but it is obviously important to understand time & space complexity of anything you run in a browser. Kyle did a good job of explaining that later on in this video, but I did chuckle when the video started. :)
Not convinced with this crash course Didnt explain the other types of time complexity like O(nlogn), O(logn), O(2^n). Not to mention space complexity is another important concept that should have been touched. Knowing only time complexity alone wont give a guaranteed success as a developer since memory consumption analysis matters as well.
Amazingly clear explanation as usual! Till now I only had a surface level understanding of Big O notation but now I feel much more confident about it, thanks to you! A perfect video to brush up on basics 😊 PS: hope your arm wasn't too sore holding up the letters for 3 mins straight! 😜
Correct me if I'm wrong, but console log something n times still gives you time complexity of O(n) as you perform some action n times. It makes no difference if that is console log something or creating new object. O(1) gives you result in the same amount of time regardless of the size of your input
Correction n^2 grows quadratically, which is polynomial, not exponential. In short big O notation is the most significant component of the algorithm complexity function, which represents the amount of computation required(worst case usually) for a given input size. I.e. it's the shortest way to express algorithm complexity, without writing the entire function of it, which makes it easier to compare. Comparing algorithms becomes as easy as: O(n^n) > O(a^n) > O(n!) > O(n^a) > O(n*log(n)) > O(n) > O(log(n)) > O(a) Space complexity is usually not a concern, simply because it's pretty much unusable for anything > O(n^2) for any meaningful input size. I.e. you can't really use such algorithms unless they are in the very efficient side of the scale. But yes you can use such notation to illustrate any type of complexity. Time, space, calls(i.e. non local time) and so on. To be fair it's not much better for the usability of time complexity algorithms. While you can do slightly higher power polynomial time complexity algorithms it's still polynomial ones or faster that you can run with any meaningful input sizes. I really think you missed the opportunity in this video to illustrate how fast the amount of computation requirements grow with complexity even for small n=50. n=3 is silly really for algorithmic examples and won't impress anybody even with a O(n^n) algorithm it's 3^3=27
Hey Kyle! I love your videos and thanks to you, many complicated concepts are now crystal clear. A big thank you for these videos! PS - Can you please make a video about service workers?
Yes, but once you figure out the O notation - What do you do with it? Do you put that notation through the computer? Or is it that you see it and say hey look O(n^2) looks bad so let's change the algor. I kind of find it useless.
I have a question related to Data structure and algorithms. we have studied bubble sort has a big O worst-case time complexity of O(n2). Linear search has O(n) and binary search has O(log N). With all the above info, my question starts here sir, let's have an array. we will apply the binary search to search an array element, before binary search we need bubble sorting because binary search work on sorting. worst case and good are equal linear. Question Can we say linear search === binary search? bubble sort O(n2) + binary O(log N) ) / 2 = linear O(n)?
Which language is best for learning, data structures and algorithms. I'm very good at javascript. & very familiar with java & c. Please somebody HELP ME. as I have to continue with js or java or c. HELP ME, HELP ME.
Help me .... I wanna know about saving images with base64 / blob ... what are they how to use them ... are they usefull to use ... im working on cordova to create an android app ... OR tell us how to store user images effectively like profile picture and other images.
This video is old but I didn't understand why it is O(1) instead of O(n) at 9:40? Is it because data[i] is already allocated in memory but data[i] + data[j] is a new variable that uses a new space?
