Data Structures and Algorithms in JavaScript - Full Course for Beginners

[@Tidalley]

0:20 Stacks 9:04 Sets 19:24 Queue 26:03 Binary Search Tree 53:20 Hash Table 1:03:05 Linked List 1:15:00 Trie 1:27:29 Heap 1:42:08 Graph

[@Tidalley]

@INTELLECT How many licks does it take to get to the center of a tootsie pop? The world may never know

[@shridhar_rao]

Thanks!

[@msdhaliwal]

09:04 sets

[@Tidalley]

@@msdhaliwal Thanks, added that in

[@Ali-Aziz-official]

I love guys like you. You save me time.

[@agussatria7138]

Everyone has a different level of ability to learn. If you feel you don't have a very smart brain, that's fine. Don't compare yourself to others, even if it's late than others, believe me you can do it. stay consistent

[@jeroincababat565]

Thank you :)

[@melania239]

I needed this. thanks :)

[@Rdx_rahul04]

@@jeroincababat565 thankyou 💕

[@ponalvsiki2254]

In fact my IQ quote increases since I started learning to code. In went from 97 to 120 in 6 months.

[@xXPIEATERXx]

Thx bro you, gave me a little strong motivation for myself. I have a hard time learning things during pandemic.

[@jasonhoi85]

this is very good for someone like me who don’t have computer science degree but end up work for coding

[@rinidebnath7037]

Same

[@marcusaureliusregulus2833]

Hey are you in a job now? I am also following a similar path

[@pz5109]

I'm going through this course and I just can't speak enough of the efforts and quality of these videos. Beau is an amazing instructor!! And thanks again for putting this together.

[@hacker3191000]

33:45: For Binary Search Tree: the isPresent() method can be simplified with the find() method. Just return true if find() gets a match, else return false.

[@gardymorisseau8420]

Watched this back in august felt dumb, then learned another programming language came back and now cant believe how good he was explaining it. Thank you i understand!!!

[@EfrainMcshell]

This man is so eloquent..... I like his explanations, and peaceful personality I could say humble....

[@diegazo5556]

Oh lord; just 10' of videos and inmediately started writting code, different ideas for getting different things done. Amazing! And the best part is that I was (AM) terrified of learning data structures because "they are so hard for people whose zucks in math" (which I do). Lol, thanks so much, I will continue watching and writting code!

[@vardaan_agarwal]

Maths!! 🤧🤧

[@bnouk2777]

15:31 difference need to repeat the add part for the other set. A and B difference is not just A not in B as in the code, but also B not in A.

[@deyandimitrov1304]

Thank you! I spent some time over this at codepen and I found it contains some really lovely implementations of the most common data structures into javascript and the code is really neat and self-explanatory, hardly needs any comments.

[@jamaalTRW]

Thanks so much for doing this course. I liked the instructors calm demeanor and voice. Also, the explanations were thorough with code examples. This will help me as I work through the leet code problems.

[@veebxl]

Thanks so much for this course! It's a tad too fast , I had to rewatch it at .75 speed. 😅 But it's super helpful, thank you!!!! 🙌🏻

[@whaaaaaaaaaaaaaaaaaaaaaaaaaat]

What a perfect timing! I'm going to tackle about this topic. Thanks for the video. Hope more computer science-related stuff is coming from this. 😁

[@RahulD600]

I didn't really expected to understand this, but now I finally am able to really understand these concepts! Thank you very much!... *One important message to all of the people who are trying to understand or having difficulties in understanding this:* Don't give up, try to clear the basics first, see some videos about Object oriented Programming and practice some functional programming, you'll be able to imagine everything in terms of objects and arrays in javascript, this will help you understand this better! Make sure to watch a few videos and study a few articles before watching this video if you don't understand some of the concepts like BST, LL, etc...Just don't give up!

[@jamaalTRW]

Great message I agree 100%

[@oscarenbacka_4909]

I have watched so many videos about DSA, this is the first time everything just makes sence. Thank you!

[@varchas-v8777]

This video is so underrated! This is something every JS developer should watch.

[@goyal9968]

Why every developer should watch? Instead i heard it's bad idea to learn ds and algo in js, go for c++ for ds and algo. Is it true?

[@varchas-v8777]

@@goyal9968 I said every JS developer should watch this because this is one of the best ways to hone the concepts of prototype and class

[@geekyprogrammer4831]

@@varchas-v8777 well said son!

[@naveenkamath2882]

Cany we use vs code to do these programs

[@sachinkotian6250]

@@naveenkamath2882 yea obviously

[@IYCActriz]

This is exactly what I need to become a better programmer. Thank you so much!!!

[@yashrajbasan2689]

Finally computer science topics are coming.love you freecodecamp

[@paulbh4953]

Thank you so much for this content. Data structures sounded really intimidating, and it was confusing for me to understand how to apply them in Javascript. Thank you!

[@KrishnaTandon]

Need an in-depth tutorial for Asymptotic Notations with multiple examples. Beau, excellent lecture. Thanks

[@spiritual5750]

I have been facing imposter syndrome due to Data structures and Algorithms. I have been facing this since the last 3 years. Struggled to get job as well because of this. I hope i can overcome this through your videos.

[@stevemarquez6865]

I feel the same way. I interviewed so much and failed. But I am still here. Trying toi get better.

[@spiritual5750]

@@stevemarquez6865 man if you need any help, I am here for you! I know how it feels. It definitely gave me motivation

[@seifeddine3735]

@@spiritual5750 hello , i ma 27 years old and still looking for job could you say somthing that can motivate me please ??

[@spiritual5750]

@@seifeddine3735motivation comes from within yourself. Try watching videos such as perks of working in a company, imagine what you could fulfill all your dreams with getting job, be it travelling or taking a vacation. Think positive, it's all about mindset buddy. It's ok that you are 27, it is never late. Promise yourself that in 6 months you will work hard enough to get a job and do what makes you happy. All the best 🙌🏻

[@crystalclear178]

Same ..30 yr old ... struggling to get job... people says why don't you earn you are sw engg... but I don't have skills....I'm trying

[@spaceenthusiast5696]

This video is amazing! Dude i guess the god sent you to teach humanity Data Structures & Algorithms of Js.But i have to say that, this video is not for beginners.This video is for the one who has the all basic stuff and know how to code in JS. actually.

[@karimkrimou399]

I'm watching this video the fifth time and every time i understand it in an other angle and i still need to do it again thanks beau

[@johnbaker7102]

39:34 Great stuff, but you are WRONG on the height of a tree. Using the min/max height method gives you wrong results on certain trees. The height of a node is considered the max-height of that node, and so for a tree to be balanced each nodes' left and right substree cannot have a height (max height) difference of more than 1. For example, insert this in a tree in order (50, 40, 30, 45, 48, 100, 90, 120, 80, 95, 110, 130, 60) in this case the tree is actually balanced, but your min/max method will say its NOT. because the min height is 2 and max height is 4, which is WRONG. I hope people see this.

[@tomisinergy4963]

I recognize your voice immediately from the boot camp now I see you for the first time. By the way, you are one of the best teachers in the world

[@Jonesybabie]

I am absolutely ecstatic about this presentation. This is what I've been looking for! 😍😍😍 Thank you!

[@DininduWanniarachchi]

Love this lesson! Please guys please make a Compiler Design/Interpreter/Language Design video series I'm very exciting on it!

[@sleeplessdev7204]

Just what I was looking for! An explanation of data structures and algorithms that doesn't treat me like a novice programmer, but also doesn't confuse the topic by going deep into number theory. This was juuuusstt right!

[@aramistanboulian6212]

Im in a phase where i got my internship extended cause my area in dsa is weak, so ill be taking this course to improve my dsa skills, wish me luck guys🙏🏻

[@silverslyer]

Thanks!

[@JSDev776]

please dont use arrays for queues, the shift and unshift operations take O(n) extra time unlike stack's push and pop, just use a basic linked list, the time complexity will reduce, the only benefit arrays provides is O(1) access but you don't need that incase of stack or queues.

[@andrewjensen724]

These lessons are great! Though while going over these explanations of what each data structure is and how to code one from scratch, I'm wondering: what is the real takeaway from these explanations? Is it more valuable to know how, for example, to code a Set from scratch or is it better to just be familiar with the data structure and its methods? My guess is that most job interview questions involve a problem whose solution requires the use of one data structure vs another. Do interviewers ever ask candidates to actually build one themselves?

[@AnnaCuriousa]

That is a precious lesson! Thank you so much for it!

[@cipherCrafters14]

Anna Bushma can u give me your phone number I want to friend ship with u

[@nromancarcamo]

@@cipherCrafters14 Get a life dude!

[@MuhammadFaisal-nv9iu]

@@nromancarcamo An Indian can't get a life.

[@iamparitosh]

Didn't know a word of JS before the video and now I feel like the master of JS already!!!

[@ctkqiang]

Finally !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! As A Javascript dev. I am so happy to see this finally....

[@geebsayshi]

This confirmed my worst fear: I'm dumb EDIT: watching this again after 3 months of studying I feel less dumb 😂

[@Rodrigo-ux6mr]

haahahahahaha

[@julietgeorge4858]

lmaooo , I told myself that acceptance is the first step ...

[@tannerbarcelos6880]

Take the punches my friend. You will find many of these things are easy when applied and many are not. I am graduating comp sci next semester and am relearning DS/Algos in JS for full stack roles and SWE in general so i feel dumb too haha. But everyone is a human and it takes work. You got this!

[@geebsayshi]

@@tannerbarcelos6880 wow! Thank you for the nice words

[@davidhahn7391]

first time around you won't get it maybe 2nd or 3rd lol

[@IcarianX]

This is a fantastic video. Excellent examples, nice, clear, easy to understand code, and good explanations. Superb job, well done and thank you!

[@tenzinwoeser6842]

Man this got me thinking. But loving it!!!! I guess that's the beauty of programming.

[@PeteStMartin]

Thanks! A lot to digest here, but exactly what I was looking for.

[@EduardoLeviBC]

if this stuff is for beginners, imagine the Jedi stuff

[@mickeytete9036]

This is the Jedi stuff. You just have to master it.

[@JSDev776]

it really is for beginner, most of what he showed is not optimized at all. btw even the most jedi stuff is basically the same sets of operation. everything is simple if taken in small bitable chunks. then you build up just like DP :)

[@JXSHVAEXE]

I fear not the man who has practiced 10,000 kicks once, but I fear the man who has practiced one kick 10,000 times. - Bruce Lee

[@sheneverwas]

Thanks so much for an easy to understand video! With visuals AND code. 👏🏼

[@AnishSana]

EDIT - The bug seems to be in the code sample link provided. The 'else' condition in the remove functions is returning nothing (undefined) instead of node. The BST section seems buggy. The remove function of the BST does not work. When you try to remove some of the elements, it wipes out the entire tree. Ex: const bst = new BST(); bst.add(9); bst.add(4); bst.add(17); bst.add(3); bst.add(6); bst.add(22); bst.add(5); bst.add(7); bst.add(20); bst.remove(17); console.log(bst); Output: BST { root: undefined }

[@ahmadabdolsaheb]

Great job, Beau.

[@shabeebck3057]

This is the one and only video to become the programmer 👌👍👍

[@adrianfletcher8963]

I love that you all constantly upload videos to your channel.

[@PlayBetterJazz]

amazing video! wish I found this while attending the boot camp I went to

[@saipavaninagisetti5286]

This was such an awesome video! Thank you so much for such a clear explanation and implementation of DS in JS.

[@JaisAbhay]

What a quality video which i was looking for. Many thanks

[@Oveia1]

Thanks man! That's I really need these days. Great job!

[@AndrewTSq]

This man is a legend. Thanks for your brilliant tutorials.

[@gauravmall3743]

Great lesson Mo, A minor correction In BST example though (video at 36:56).... Since BST is always sorted, node "23" can never have a right linking to a lesser value (in this case "19"). In this scenario value "19" should not be there at all. Also, removal of node in BST can be revisited. The replaced value should be the max of the subtree (so 23 can be safely treated as a new node to be replaced in left subtree for your scenario) . Happy Coding!

[@grandpaK420]

is this course still good even after 4 years?

[@gauravmall3743]

concepts are evergreen :-D

[@tw04]

This is just what I was looking for! Thanks a lot!!

[@KatherineMartin502]

This video is dope. Great teaching tool

[@abdiali8579]

Thank you Beau, you are Awesome!

[@spacecats3649]

Awesome! Onsite interview with JS DS. This helps me study for it :)

[@blankLines]

Excellent! This is just the coding video i needed right now :)

[@romanpelikh1862]

Thank you for your time and excellent explanation.

[@sio5420]

Thanks! Was really clear explained! Thumbs up.

[@AmericanDragon134]

Beau you are the best

[@sharlokholmoz4283]

that is so important. I was looking for it

[@kearfy]

The second one would be "racecar".split(""). reverse().join("") => "racecar"

[@boogiman14]

Micha de Vries whats the time complexity on that?

[@spacecats3649]

Am done with my CS degree and pretty burnt out. Now I'm getting ready for technical interviews!

[@romanmueller3479]

How you prepare for interviews?

[@KaisanFacts]

Please add 0:00 in front of it then it will appiar on the video timing roadmap

[@hugon4]

that was fun af never imagine I could understand that

[@NB-ph6cv]

in minute 48:03 the line 143 if left > right , return left +1 , else return right +1, (should be?) if left > right , return right +1 , else return left +1, because the same syntax is used for left < right ?

[@emilywong4601]

I learned data structures in C,C++ , Java and machine language years ago. And database design with sql server and access with visual basic.

[@emilywong4601]

Push and pop are machine language keywords.

[@emilywong4601]

Hash tables???

[@nocturnal-chou]

@36:39 Why do we need to go node.right? And then node.left? Can anyone provide an explanation?

[@artihlec]

As a bonus task - I encourage everyone to implement set DS using regular objects (rather than array) in order to drastically improve performance.

[@lalaithan]

Spectacular explanations. These kinds of videos are the reason why I wish KZbin had some sort of go-back-30-second button.

[@freecodecamp]

Just press the left arrow key to go back 10 seconds at a time.

[@lalaithan]

@@freecodecamp Thank you for that tip! 30 seconds would be better though.

[@nil2307]

The Set implementation is not correct, you are using indexOf(), which has a time complexity of O(n). The real implementation of Set.add() uses hash tables, which takes O(1). Deletion in the queue should take O(1), but your implementation takes O(n)

[@nelsonjimenez7939]

I dont understand You are very smart. Im a newbie

[@lgiorgos1]

Sets don't have to use necessarily hash tables. They can, but they don't have to.

[@nandhannatarajan2127]

@@lgiorgos1 I mean lets be honest sets should use hash tables. The only reason sets are used is to search for values in O(1). If Sets were O(n), there would be no point in using set over array.

[@sunnilabeouf]

@@nandhannatarajan2127 Sets are also used because they contain unique values, as opposed to filtering out duplicates in arrays. But yeah, they should utilize hash tables, most other programming languages call them HashSet

[@bryanstrader1740]

Just came across this and had a question, add and delete are O(1) when using hash tables, but when implemented using hash tables is the constructor always going to be O(n) when initially setting up the table of keys/values? That might just be a trade off, unless I am missing something.

[@rinordreshaj1962]

in 46:52 did you mean == instead of more than or equal too, since it's a balanced tree and you are already subtracting 1 from the max height, so the difference should be ( minHeight == maxHeight -1 ) to be balanced.

[@ankitsharan15]

+1

[@mickmoon6887]

Good video thoroughly explained bit envious wish I had this video released bit earlier

[@laerciogoncalves1361]

That's gold!Thank you, Beau!

[@moni12358]

this is a great video! I really needed this. Typing the code out as you explain it can be helpful for retention and slowing down when you do write the code. Similar to your python and SQL videos.

[@mohitkale6879]

Awesome tutorials with awesome examples.

[@mateja176]

Outstanding lesson 👏 would've been nice to see an AVL tree in action. By the way, declaring helper functions outside of methods may increase readability, additionally relying on hoisting can be confusing.

[@thirstypooch]

you made my day !

[@nocopyrightgameplaystockvi231]

Learning this in my job, thank you!

[@SumitRai87]

Nice informational video, but I couldn't help but notice that a lot of places could benefit from using a Map or an object instead of an array like HashTable implementation which needs to be O(1) for lookup. A lot of implementations could be optimized for better time complexity.

[@vaishnaves195]

Hi Beau ! Thank you so much for this series. I found it really helpful. 1. Regarding the removeNode in the Binary Search Tree, wouldn't we have to check if the data that is passed to be removed is present in the tree or not? Could we do this by adding an isPresent inside the remove method? 2. If I would have to implement a display tree method, how could I do that, complete with the tab separation so that it looks exactly like a tree?

[@your_utube]

Creating apps to play with these things in Js will be more interesting as I find ways to use it and train my mind to think in terms of the algorithms. Some I've used in other language environments, but not all. What would be a nice follow up would be sample apps to help benchmark or compare using inefficient ways to these methods/algorithms when applied to some sample data sets.

[@myuniverse-f8r]

awesome video!!! thanks a million

[@colorizemysky]

1:40:17, lines 50-51. Why do we again calculate 'right' and 'left'? They should to change automatically after 'i' changes a value, aren't they?

[@indraxios]

Beginners Alert!!!!! This is for people who already knows data structures and want to practice them in javascript once

[@spyfromsparta]

This is beginner level to Data Structures and Algorithms but need a prior knowledge of Javascript.

[@a.v.sanchez9193]

Pretty sure the ES6 implementation of the "has" method on a set has constant time complexity, i.e. O(1). The above implementation of the "has" method uses "indexOf" array method, which has O(n). Am I wrong? Pretty important difference, if I am right.

[@stelloprint6533]

that's a good point, so it would be better to create a new class off of the ES6 Set such as: class mySet extends Set {...}, then add the union, intersection & difference methods as described on MDN docs developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set

[@Michael-kp4bd]

@@stelloprint6533 i like this idea. This tutorial relied a lot on arrays and array methods for these custom data structures, where in doing so unnecessary uses O(n) methods when there are more optimal solutions… especially if you’re making custom data structures anyway..

[@sshyam2903]

at min 38:25, what if the child were 0 instead of 4? Wouldn't it be violating the rules of the BST, since the node containing 0 would have left child greater than 0 (1)

[@bruhmoment3731]

Not sure if you made a mistake at 22:57 I think elements with priority 5 should come AFTER elements with priority 4, right?

[@Theladspodcast23]

can u please explain to me if the class Node and class BTS link together in binary search tree.what confuses me is node.data(does this refer to this.data in class Node)

[@ipapoutsidis]

Nice video my friend, one observation you can use an object literal to do this all.....:)

[@michaelnimmer222]

great video, very clear explanations

[@niittu_yogshala]

For stack, in pop function splice must use instead delete function. Please correct me if I am wrong @Beau

[@renatolins9812]

I hope some day Javascript will become the absolute and more loved language for anything. Nice lessons!

[@Colstonewall]

If Javascript wasn't used on the web, virtually no one would use it, lol. There would be no reason, because as a programming language it is subpar. When you have or see books, videos, talks about "Javascript and the weird parts" or Javascript and the bad parts" that should tell you something right there.

[@Ali-lm7uw]

@@Colstonewall I agree, JavaScript is a bit of pain in the ass. It takes a long time to learn. Other languages are pretty simple compared to JS.

[@craylawj3410]

Nice explanation bro , the best video among those ihv watched so for but sad enough I can only subscribe one times , I would subscribe as many as possible , much thanks .

[@geekyprogrammer4831]

This is better than Udemy courses!

[@jhuluan-jyun2594]

you are such a great teacher!

[@moofymoo]

Looks like algorithms part is missing. This is about implementing data structures in javascript and writing test code to see that data structure does what it does, but not about solving algorithmic problem by picking right data structure(s).

[@Xilent1]

Where did you find a video hat does the latter?

[@IndraKurniawan]

Thanks goodness, I had data structures and algorithm classes before JavaScript was a thing.

[@lasseh79]

15:42 The difference-method should loop the otherset also right? You are missing the unique values in the otherset or am i missing something here?

[@droidJV]

I was wondering the same and looking around it seems the difference between two sets A and B is indeed defined as simply A-B. There is another term which describes (A-B)+(B-A) and it is "symmetric difference".

[@PlatinumBuckGorilla]

I’d prefer to chop the tree up into a collection and apply the manipulation there. But.... it is not always the case. Understanding this is equally important

[@LEK-0525]

It was extremely hard to code Java... I have never learned about coding thing before taking this class... But I must overcome to follow the era of the forth industrial revolution lolol

[@NB-ph6cv]

in 1:31:11 min 5/2 is 2.5 and round for it is 3 :D