Before Your Next Interview Watch This

There are tons of data structures and algorithms that you can learn but you do not need to know them all. In this video I will share with you the 10 most important data structures and algorithms that you need to know in order to pass your next technical interview.

📚 Materials/References:

🌎 Find Me Here:

⏱️ Timestamps:

00:00 - Introduction
00:36 - Linked List
01:52 - Binary Tree
03:11 - Stack And Queue
04:57 - Merge Sort
05:52 - Dictionary/Map
06:37 - Graph
08:17 - Binary Search
09:33 - Breadth/Depth First Search
10:54 - Memoization
12:23 - Recursion
13:09 - Big O Notation

#DataStructures #WDS #Algorithms

[jenhul]

The stuff they tought us in computer science courses in 1978. Still going strong. Learn this and you stand on rock solid ground.

[Vedant-M]

1. Linked list
2. Trees (binary tree)
3. Stack and queue
4. Merge sort algorithm, quick sort
5. Map, hash
6. Graphs
7. Binary search
8. Breadth first search, depth first search.
9. Memorization
10. Recursion
11. Big O notation and complexity

[naveen]

Ohh man, I never get bored while watching your tutorials because those are on point, easy to understand for absolute beginners and with real life examples which makes it even easier to understand even better.. Thanks Kyle!!

[TodorescuProgramming]

This video was really straight to the point... No need to go through 10 hours of courses and get confused about all of these structures like I had to go... Great job Kyle!

[DThompsonDev]

This is really great Kyle! Data structures and Algorithms are a big part of the hiring process and I try to do an algo every day or so to keep my skills up. Linked lists are definitely something you need to understand inside and out. Most common coding interview question in my opinion and you will more than likely NEVER use it in the job lol

[andresroca]

Great. Cool to have some visual explanations of fundamentals. With tech advances, It seems that every day more and more problems need you to think hard and figure out an algorithm that uses trees and concepts alike. Thanks bro. 🤙

[mokroargra]

I have been looking for a video like this forever. Just wanted something that listed out the different algorithms so I can dive deeper into each one and learn them. So many videos want you to watch 8 hours of them talking about 1 algorithm or data structure which is fine but I like to see the 10, 000 ft overview first to setup a learning plan vs trying to chase down each algorithm that may or may not be used in interviews. Thanks man.

[oOobarca]

Awesome vid man. I do gotta say it cracks me up every time you say memoization lol, sounds like Elmer Fud trying to say memorization.
Keep up the great work webdev!

[jugal]

Thanks a lot for explaining these important topics in a matter of minutes. I request you to create more such videos with more in-depth knowledge on DS and algorithms. Love your channel. ❤️

[John-qkmk]

Damn looks like i was the 2nd viewer, first off, THANK YOU! I really appreciate your videos and your calm/simplified manner of teaching. I would love some more videos on this kind of stuff! it would be great if there were some code challenge walkthroughs with this sort of stuff. keep up the great work!

[tigranharutyunyan]

I think it should be enough for frontend devs to know and explain those structures without much coding. Thank you man!

[vaderproductions]

MORE CONTENT LIKE THIS PLEASE!!!

Thanks for sharing!

[snansahmarov]

OMG. You are very good. Just searching for this for beginning again al this stuff.

[jasonlough]

So, the title of this channel is 'web dev simplified'. These things in this video though, a senior FE or BE dev will probably NEVER use. Ive been doing web dev work since the 90s and I can count on one hand the senior web devs, web architects, or team leads that knows these things deeply and can code them without looking up something.

What they DO know (and extremely well) is their tools (like vs code, or phpmyadmin, or chrome dev tools), their platform (like shopify, netlify, or AWS), a couple of technologies (react, or sql, or Go) and a couple of techniques (like REST, CRUD, error handling).

That said, even though youll never use a binary search tree as a FE dev working as an angular developer, these things are good to know, and this video has a lot of things that would carry over into other areas, such as game development, finance, higher math, AI, optimization techniques etc, and the knowledge applies across all languages.

[shelbyrothman]

Always the best content, thank you Kyle

[mykalimba]

Bonus interview tip: when discussing a collection of vertices with your interviewer, don't call a singular instance a "verticy". It's a vertex.

[thedevcristian]

Such a great content creator. Thank you so much.

[berrieberrie]

thank you brother, small duration but massive information ..just like a stack..waiting to be watched ^^

[davidsnyder]

You can forget these as soon as you get the job because you only need to know them in the interview

[kirkanos]

Breadth/Depth search is mostly chosen over the width or the depth of the graph, whatever is the heaviest.
Those graphs are rarely squares.
This asymetry is usually known even before using the graph and injecting values.