Do you want to see more videos with a technical "interview prep" focus? Usually I cover practical projects, so curious to know what you think...

@sadn1ck

4 жыл бұрын

YES please! Much love!

@nicolasferrero9928

4 жыл бұрын

I like this videos more than others

@PrakashVl

4 жыл бұрын

Yes interview preparation, this one is awesome

@abhinav.sharma

4 жыл бұрын

YEEEEEEEEEEEEEEESSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS

@sagnikpradhan3594

4 жыл бұрын

Yes!

I would love more algorithms, data structures, and ML too!

Thanks, with my 6 years+ experience as a Frontend-dev, I now feel like a junior-dev again 😅

@shygrammer

Ай бұрын

you just said it!

+1 for the "x in 100 seconds... but wait there's more!" format. Getting a brief overview of the concepts followed immediately by a more in-depth implementation of those concepts is a fantastic way to structure the video.

I would’ve needed this for my computer science class 😫😫 Once again your content is the high quality learning we all needed

@athulp6591

4 жыл бұрын

In my case , it is right on time.

@miteshkumar3183

4 жыл бұрын

This is a basic topic in a first semester computer science class.

IF CS WAS A MOVIE THEN THIS MAN YOU WOULD BE THE AUTHOR

@YoloMonstaaa

4 жыл бұрын

Movies have script writers and directors as key creative roles. No authors.

@calvinebun-amu5397

4 жыл бұрын

100%

@Fireship

4 жыл бұрын

I'm writing a screenplay titled "CS - The Movie" ;)

@raymondmichael4987

4 жыл бұрын

Fireship, I'll definitely watch it. Greetings from Tanzania 🇹🇿

@abelkidanemariam6485

4 жыл бұрын

another Ali gate fan here

So glad. While these X in 100 seconds videos are great for some topics, this definitely needed a longer one.

@Fireship

4 жыл бұрын

Thanks! Yeah, trying to decide if I should make them as completely separate vidoes

@Pogibakayo

4 жыл бұрын

Fireship I’d certainly love that! But honestly, anything you put out is gold. You’re on fire.

@Ajay-ku6oq

4 жыл бұрын

@@Fireship Maybe release them simultaneously so that people who want can watch both and there is a higher chance of one going viral.

@Sunwarul

4 жыл бұрын

@@Fireship Please make this type of video with a slow pace. Your teaching style is good. but just take longer and bit slower-paced videos. Give some time to grasp the concept along. However, like these videos. Thanks!

@LineageFalcon

4 жыл бұрын

Fireship Yeah, I think u definitively should do that. Some of your viewers want more in-depth information and with a bit more time to consume it. So I think it is a good Idea to do a 100 secs version and a in-depth version. Anyways I really appreciate your work and passion. Thank your for your vids. Have a nice day. :D

Definitely want Algorithms, Design Patterns and Data Structures 🙏

That was sweet! Please create a playlist of data structures and algorithms. Great content, keep it up 👍🏻. 🔥🔥🔥

Every time the outro music fades in, I can literally feel that 'i get it now' rush ! Thanks a lot and keep up the outstanding work !!

I really appreciate this format especially the combination of 100 seconds & beyond 100 seconds

This video is more than worth of my three year CS degree 🔥

5:32 Javascript destructuring in 100 seconds

@eshaan7_

4 жыл бұрын

more like JavaScript de-structuring in 100 milliseconds.

100 seconds of different time complexities as in the Big-O-Notation would be awesome. I tend to forget how they work when I haven’t dealt with them in a while (same with Regex) so I think a 100 second reminder would be perfect!

In 10 Min, I came out with a better understanding of graphs then I have in the previous attempts (which was a lot). Thanks for making graphs make sense.

This is really nice. Also try making the speed 2x and watch it like 3 times if you want to overclock your brain. But it could cost you a few more seconds tho :/

@oladimejiakande9070

4 жыл бұрын

😂

This video is awesome! I love seeing these 100 second videos pop up in my feed, they’re always fantastic. One note though: an adjacency matrix does have very bad space complexity, but part of the reason for that is that it’s making the trade-off for time. It actually is quite time efficient to check specific connections [O(1)], so it just depends on what your program is prioritizing or needs.

I really enjoyed working with these data structures and algorithms in JavaScript. I would love to see more of this!

I can't believe I'm watching this in my leisure time. This is quality content! Keep them coming. Would love to see more algorithms explained like this. Thanks buddy, you're a rockstar! :)

Wow! This is awesome 🙌 would love to see more of this!

You've made this one understandable enough for a person who hasn't yet got to this part of programming. Solid introduction to the topic. Didn't get everything, but the idea is very clear. Cheers!

I love this! Very clear explanation. I would love a mix of project videos and interview ones like this.

Yes, I would definitely like more videos with technical interview prep focus. I'm probably a ways off of an actual interview, but it's nice to mentally prepare proactively because I'm such a good procrastinator!

This was amazing! Great speed, great length, great everything!

Make all 100 seconds videos like this, a 100 seconds explaining everything simply, then go into details...this is awesome

fireship does youtube like no other channel the "basics in 100s + deep dive" format is a blast, man

I had to figure all this stuff out on my own when trying to implement A* pathfinding in a game I made. The tutorial I followed used an adjacency matrix. But my game maps were 1000 x 1000. The whole thing crashed when it tried to build the matrix. So I manually went through and converted the graph to a list structure, so only nodes with edges were stored. I guess I could have saved the whole thing to the hard disc instead of keeping the whole graph in memory at run-time, but I learned a lot fixing that problem.

Thanks for taking the time to make this great video! I'm doing interview prep, like many others. There was a problem I ran into while recreating breadth first search graph traversal: the enqueue in the 'bfs' method was happening regardless if the destination was in the visited Set so I ran into an endless loop scenario. I removed that and just kept the enqueue in the 'if not visited' statement and I get the correct answer. Please forgive if I just missed some of the code in the tutorial and thanks again for the great video/succinct example!

This hooked me like crazy. Please do more data science and algorithm videos like this. Loved it!

Finally somebody explaining Algortithms with Javascript Sets and Maps! Thank you.

It is so nice knowing that you decided to use recursion instead of stack in DFS to show to show it can be down either way. Thanks a lot Jeff 😍

This is great. Best implementation of DFS / BFS I have seen in a while. Thanks.

Bro! The way you explained this and the neatness of your codes I could grasp the Graph theory quickly. Please make a series.

Would be great to do more of these technical "intervew prep" videos. Awesome explanation! Sums up half semester of Algorithms course :D

Great timing, would definately love more videos like this!

I needed this for my computer science class , your content is the high quality learning we all needed

Awesome job! Thank you. 100 seconds is great no complaints but beyond is next level!

If only I knew that Javascript was this complex before I would have paid more attention to it. I'm a backend developer and thanks to your videos I have been slowly getting better and more interested in Javascript. Awesome work as always keep up these explosive contents!

Amazing, as usual. It’d be awesome if you created a full course on algos. Thanks! 😃

The format of these videos is brilliant! 100 seconds intro and then, if you want it, some practical implementation.

Yes, definitely want more data structures and algorithms videos like this! Thanks for these videos, I wish I would’ve had you as my CS Instructor 😂

It's crazy how much I learn from your videos in such a short time. Thanks you are the best.

3:25 "go slowly and explain every step!" while going on for 10½ minutes like an absolute rap god xD Had to watch the video back to back twice and still only got half of it, but loved all of it ^^

This was incredible! Finally a real world example where you show the power of recursion 🙌

Hellllll I loved this video. THANK YOU!!! This channel is seriously awesome. One of the best coding channels in the entire internet. ❤

That was awesome, keep it up with more advanced stuff

Been enjoying your content for years, Jeff. Wish I had you when I studied CS :) Suggestion: Sort algorithms for DBs and why they're useful in different scenarios.

Thank you！This taught me more in a few mins than my professor in hours!

this actually just helped me in a FANG interview, great stuff!

this makes so much more sense than any CS video i've ever watched

i love your channel for a long time. content and form are premium. i confess i was not so engaged with 100 secs videos. seemed hushed. this approach with 100 secs as intro to something more in depth following is perfect to me. thanks for such great work.

I didn't know I needed a fireship video about cs theory until I watched one. Plz do more

Please provide us with more algorithm, data structure videos which also focus on the interview perspectives, like this video did. Love your efforts man!!! Thanks

wow so fantastic, so fast and all necessary details/CRITICAL details are covered with real time application. This really makes me so excited to dig deeper into the topic. Keep posting more informative videos like this. And could be also attach code in the video description in popular 3 languages like python, Java, c++ along with javascript

Some people were really born to teach.Congrats

Very clear instructions. I only know Python and I completely understood your coding process with Javascript.

Thanks man , I used to fear from this topics , you made so easy that any non tech guy can understand completely . God bless you 🙏

great video! quick and efficient refresher for stuff i touched 10+ years ago when i did my bachelor's. thanks :)

Loved this. 100 seconds to grab attention and beyond for serious developers

+1 for more algo/ds in JavaScrip! Amazing content.

OMG, this video actually solved the programming problem that I am having today! Just my luck, thank you so much.

This reminds me of one of the first excersices of the book "eloquent JavaScript", it was awesome!

Thank you so much for sharing very high quality contents!! More CS topics pleaseee :)

When I say I was stressing! This just saved my life thank you.

That was great. I would like to see more of these. And also the thought process that takes place when you should use a Map..how to effectively use maps

Amazing video!! Practical problems are ALWAYS better than abstract ones.

This is awesome, please keep it going 👍 , need more of these .

This is really cool! More traversal methods please!

Great video. You should totally do a whole series of fundamental CS concepts.

One thing worth knowing about DFS is that while it's most commonly implemented with recursion, you can actually implement it the exact same way as BFS as shown in the video except by replacing the queue with a stack instead. After understanding it, I thought it was a bit more intuitive and easier to remember (since two birds with one stone). This is also good to know in case an interviewer asks about the potential for stack overflow.

Very good quality content! I love it! need more videos like this....

I'm on my way to the final exam in data structure, just finished my study in graph traversal and then here is your video ❤.

This is great! Just what I needed!

This is by far the best explanation of node.

Greatest explanations i've ever seen on KZread hats off @fireship

one of my favorite videos so far!

You just saved me a ton of time. Thanks for the video. :) Keep it up.

Thank you so much. Please make more and more videos on Data Structures and Algorithms. Thank you once again!

straight up one of the best channels on yt

Amazing one.. WE need more of these :) Bring it on brother ✌

Love the beyond 100 seconds part!

Another great video! Please continue

Not gonna lie, have an interview coming up and this was amazing, thanks so much for sharing the knowledge

More on graphs please. This was one of the best explanations of graph traversal on the internet ❤

I would love to see more of this type of algorithm videos in a slower pace. I love your explanations but its hard to keep up as a beginner when you're going so fast lol

Great explanation as always, thanks! 👊

This content is GOLD. Tyvm

Make more such videos like using some development related use cases where this algorithms can implemented , everyone will love them as the you breakdown the problem into subproblem is awesome.👍👍👍👍😁

Great video. Would love to see more!

@Fireship This video was awesome! Please add more JS algorithm content like this!

Yes, please. Would love to see data structures and algorithms in JS.

For anyone that didn't see how you get the steps at 9:49 it's `DFS found Bangkok ${visited.size} in steps`. Use the visited size.

For your BFS implementation, I think worst case time complexity ends up as O(E + V^2), because the shift() method is (probably) O(N) for N == length of the array. To achieve O(E +V) A "real" queue implementation is needed, that implements enqueue()/dequeue() in constant time.

Great stuff! Thank you for the content!

*Music in **0:00**?*

yes please we want to see more videos like this!

Really nice video! Although using map and set do add a O(logV) factor in the final complexity and, depending on how js handles popping elements from the front of the array, an O(V) factor

Sooo cool dudee!! I really take my notes and learnt from your explained

This is such a great video!Thank you!!!!

Awesome, I am interested in more algorithm and data structures content