@@xfire3778 true, but tbh you could watch this video, work through a couple easy leetcode problems and get a similar understanding. these concepts aren't super complicated and in my experience don't warrant an entire semester's worth of info. I could also be biased from my program, though
@@Afroctopus Assuming you had no prior knowledge, I highly doubt that watching a 16 minute TH-cam video and doing a couple of programming problems would have given you anywhere near as good an understanding of DSA as a semester-long class.
You nailed it at the end with the whole “learning” thing. I can’t believe colleges teach in ways that are so in depth, but don’t explain the bigger picture first. I’ve always learned best by seeing what the purpose of something is first, and then learning in finer detail.
Agreed big time, thats why people have a hard time learning maths or maths based methods because of "It is how it is" instead of explaining why do we do it.''
exactly thats how my brain learns, start with a difficult topic at an elmentary level and go down layers of abstraction on the topic until you get to the nuts and bolts of it. at each level make notes and slap them on flashcards, have them on you during work or whatever and when you go through them and take 20 secs per card to explain the question. By the time your a few layers down you look back and smile at the card notes you had to write out in those top layers, each layer produces more understanding and the top layer card answers now seem so obvious to you with the layerd knowledge you gained, adding in videos on the topic layers and your mind just starts building lasting connections to the info, well for me anyway..layer by layer, day by day..
The fact that you understood most of the things explained in this video after you've done your college part of studying on these concepts shows you that there is a possibility that you wouldn't be able to understand what's going on in these video if they showed you as a first lecture in college. Am I wrong? You think that this video is useful and that type of teaching method should come first before going into details but even what makes you understand this video is these details you've learned before watching it. Do you understand what I'm saying? How could you precisely estimate what would be your real reaction to that video if you watched it with 0 previous knowledge as a lecture on your first day of college? You're connecting ideas and knowledge you have while you're watching the video right now and then you say "OH! That makes sense." OF COURSE THAT MAKES SENSE BOY BECAUSE YOU KNOW THEM AND NOW YOU ARE REVIEWING THEM. These videos are good for reviewing your broader and deeper initial study but not to take as initial by itself.
It's kinda crazy how easy it is to teach DSA when the students actually underhand programming. I have taught this stuff to several students who are children, but I wait until they have been programming for a while and have a good grasp before introducing it. It's not that DSA is super duper hard. It's that colleges teach it way too early. It'd be like jumping into calculus before learning algebra. (Or course colleges do that too with remedial math.)
@@Mathhead2000 Is it a must that I should know how to implement these data structures and algorithms from off the top of my head without looking anything up, or would just knowing about what they are and the use cases for each one (and the methods each collection support + their estimated time and space complexity) be good enough to get the job done?
@@thatoneuser8600 It depends. Generally speaking, you don't need to implement them in practice, because someone else has already done it. However, if you're trying to get a job, it's sometimes an interview question. I would say, it's good to know how to implement them, but you don't need to be a master at it.
So if anyone watching this is getting confused, try watching this after you have a basic understanding of programming (like the fundamentals of a programming language under your belt). This will make a ton of sense after that. This is really well explained and packaged for you to UNDERSTAND what data structures and algorithms are. It's not for directly helping you solve problems.
This was recommended to me a few weeks ago and I was like WTF but just from clicking around and watching other stuff I almost think it's possible to understand, just not anytime soon 🎉
I've been watching programming youtube videos for like 4 years now. A LOOT of them try to be funny. But man, you are the first one who is so good. I'm literally watching this just because its super funnny.
I applied to Amazon and they told me to do an online test. I'm going to email them this video instead and tell them I watched it so they should just hire me.
Just a small word of encouragement from a software engineer without a degree: enough time and passion for programming will eventually turn you into a highly valuable specialist. Make it your hobby, and you'll enjoy most of the days of your professional career
@@mathbrah my personal experience with IT education system in my country was a mix of mostly bad stuff. I helped with programming implementation for a university graduate while still in middle school. And I dreamed to get into that university. Most of my former colleagues had a degree, yet a self-educated me was never lagging behind and even charged forward with important innovations. Also, many teachers force memorization instead of learning how things work, boxing one's creativity into a cage of poorly explained best practices. And let's not forget that higher education is often pretty damn expensive, especially in STEM. Software development is creative work at its core. It evolves and moves forward so fast and university/college programme always plays catching up. I felt like I'm just wasting my time, and soon dropped out of my uni and scholarship. Pure passion got me to where I am in my life, and I have no regrets. College education is fine, but one can do great things without it too
@@Nekroido You loved programming, but in the place you lived, they all taught it wrong. Its sad seeing someone waste their potential like that. I'm still 15, and I'm learning from other people's successes and failures.
This if the first video anyone should watch when learning Data Structures & Algorithms. Been watching a ton of videos, to barely grasp it and this one does such a good job of just defining it simply before getting bog down with applications -,-
Watching this after finishing DSA college course and omfg... your visual interpretations of depth first search and breadth first search literally opened my third eye
14:02 about 5 years ago, my Java class talked about data structures for months and I remembered absolutely nothing. The professors really need to talk about ALL of the data structures we are going to learn and then make a comparison every single day before class if they expect the students to retain any information.
You basically covered 75% to 80% of the content most 40-60 hours of DSA courses cover 😮! I literally solved a few easy and medium problems based off your explanation and some research on wikipedia 🙌
as a cs student myself when at 3:20 you said "... has to be sorted" i got shivers down my spine. I'm having a design and analysis of algorithms class where we tackle some of the most known sorting algorithms and its fun, but boy can the assignments be hard
Thanks a lot man, I'm also a programmer and older than you, but I still learned/rememberd a ton from this video. People like you inspire me to also bring more value to others, maybe I'll start a youtube channel myself one day, just teaching people the basics and who knows what else. Have a great day everyone!
I'm so glad I got to watch this before taking the class next semester, now I actually know what I'm about to get into and it'll be easier to understand the bigger picture. Thank you bro
As a math major who has to learn this on their own and also applies this method of “conceptual understanding first”, thank you. This is really awesome stuff.
I think this is the best video I've ever seen. Went through two semesters not understanding why it was important or how I could actually use it. Professors should just show this on the first day of class
shameless me clicked on a yt video to master dsa in 15 minutes... i well deserved it and i truly loved it.... where was this channel when i was getting bored during my college studies now that i have somehow finished the degree youtube i recommending me this stunning channel huh
I REALLY liked what you said about taking the big general idea of what you're learning first then diving deeper into it. I've had the same feeling towards that in teaching myself anything and the same frustration with the way my schools have taught. I've also described it as breadth-first learning
I feel that this actually is a good representation of the class I took last semester. Some of that might have been because it was crap because online, but I feel like its much more important to have intimate knowledge of a small amount of ideas and be able to combine them than to try to memorize a lot of stuff in CS. Like a lot of people struggled in this class, but most of them didn't seem to understand anything. On one exam we were asked to implement an obvious brute force = O(n) algorithm (given an array with some special properties, determine if N is in the array) and after we got grades back one guy posted that 'he figured out how to do it in O(nlogn) and was confused why he got a 0 for that. A bunch of other people seemed to agree with him that was unfair. If you were in data structures with me, sorry for throwing yall under the bus btw TL;DR 10:54 another interesting question is the longest degrees of seperation between any users on facebook. And of course the answer is infinity because I have no friends
I watched this video before I did Data Structures, and had no idea what he was talking about. Im watching it now after doing Data Structures and understanding everything.
Pro tip: Big O notation isn’t all that matters. A program I was working on originally used a hash map and it ended up being slower because the overhead of hashing my keys (which where just numbers) was more than traversing a binary tree. Always test for performance critical applications
I got a 95% for DSA finals. But yet, I still didn't really grasp the concept of Time Complexity especially how do we calculate O(n log n). Until today, I randomly decided to check this video out at 10 AM with no sleep and finally got it. Thanks, u legend.
You really explained everything so well, I have already watched it 3 times, whenever my mind wonder for even less than 1 second I miss the flow, then I watch it again. I'll be back to watch this video again and once I have complete understanding of this video I'll write it in the comment. Thank you.
You should make more of these. This is awesome, similar to what I want to do with content creation once I finish building my app. Except I want to teach these things by building little apps and explaining different options so that I have a real problem in the program I'm making to point to.
I've watched this video a few times now, taken 4 pages of notes, and learning more off this one video than I have in college. Somehow I've became a TL without knowing any of this and now trying to pass any technical interview is becoming impossible. JUNIORS, for the love of god. Don't do what I did and google your way through your challenges. Really learn and understand the basics before it bites you in the ass
Aye dude this is the first video of yours I've stumbled across and you just backflipped into the intro after calling the tech industry cancer, and calling this video the cure. Subbed for that alone. Absolute Gigachad.
I watched your troll videos before, so I clicked this expecting more shenanigans, but not only did you surprise me, but you explained phenomenally well, like better some college professors I had.
Dude this is so great. I learned more in this than I have watching hours of otherwise boring content. I learned, I laughed, and more importantly I *understood* . This is pure gold !!
Awesome vid! Just wanna add: In pathfinding Dijkstra's alg is inefficient cuz it traverses all nodes which is incredibly slow but it can find the shortest path to all nodes. Something like A* is more efficient since it goes through nodes that are closer to the end node and doesn't bother with the rest.
I love this video! I understand it really easily. I just don’t like how fast it is, I think just a tad bit slower makes a lot of difference. Needed to pause and repeat because sometimes I did not understand the word he said. But overall, much better video compared from a ton of explanations in TH-cam. Good job! Love it
Even though I didn't learn these subjects, now I know what to learn. I hope I will be able to come here again and type "I learned." after I get it done.
4:03 Interesting note: there actually are algorithms that can sort in O(n) time, although they're not often used. Radix Sort and Counting Sort are two examples. It's specifically comparison sorts (where you compare individual elements against each other, like Quicksort and Insertion Sort) that can never be faster than O(n logn).
Actually, Count sort and Radix sort operate with a complexity of O(n) making them the most efficient sorting algorithms, it's just that special circumstances must be fulfilled to use them :D
I have been trying to understand logarithmic complexities for a while, your explanation was so on point it only took a me a mere 30 seconds for me to understand it HUGE THANKS, LIKE SERIOUSLY, THANK YOU
Learn DSA and watch this video .75x speed 2 times, its a good revision Edit: wrote this ☝️ before watching whole video, now I think I should have watched this before starting DSA then after that
@@TrenBlack I have a question that would likely not get a honest answer if I am wrong, did Joma pay you? And what do you really think about Joma class?
@@Red-yq6nc he probably did... But that doesn't mean his course isn't good... It's actually the best data structures course I've seen in my entire life and I would highly recommend it if u have the money *Telling u as a fellow Itachi fan* XD
Dude I love you hahahaah I come here to study because I am super nervous for an interview and your video is so awesome, super fun and helpful, thank you
Hey, you kinda missed maximum subarray sum, sets, backtracking, meet in the middle, longest increasing subsequence, the knapsack problem, edit distance (or the Levenshtein distance), two pointers method, sliding window minimum, binary indexed tree (also known as BIT or the Fenwick tree), segment trees, greedy algorithms, dynamic programming, the bellman-ford algorithm, the floyd-warshall algorithm, a tree's diameter, kruskal's algorithm, union-find structure, prim's algorithm, cycle detection in graphs, connectivity check for graphs, kosaraju's algorithm, 2SAT, offline and online algorithms, eulerian paths, hamiltonian paths, the ford-fulkerson algorithm, the trie, the z-algorithm, mo's algorithm, lazy propagation, the convex hull problem, and sweep line algorithms.
I'm almost close to finish CS50 and this video covers a lot of topics that I wish if I knew before so I can have better understanding but well done bro nice video very informative
bruh I coulda just watched this instead of taking a whole ass class, this pretty much covered everything we learned..
Afroctopus okay but this is only the surface level. The class probably had you work through problems and gain a deeper understanding
@@xfire3778 true, but tbh you could watch this video, work through a couple easy leetcode problems and get a similar understanding. these concepts aren't super complicated and in my experience don't warrant an entire semester's worth of info. I could also be biased from my program, though
Facts just finished my data structures class am I’m like wtf
@@Afroctopus Assuming you had no prior knowledge, I highly doubt that watching a 16 minute TH-cam video and doing a couple of programming problems would have given you anywhere near as good an understanding of DSA as a semester-long class.
@@danielwong4800 usaco
I'm saving this for later when I can understand more than 10 words of what he says.
lol same
x2
i couldn't keep up
yeah its too fast that my brain processing can't keep up haha
maybe not, i finally understand what tren black was going for.
Your efficiency of communication is O(log(n))
O(1) ☺️
o(n)
F*cking linear
O(n!)
O(nlogn)
O(n)
Got my algorithms final tomorrow. This is all the studying I'm going to do
How'd it go?
@@MacAndSwiss Got a C lol should've studied... dynamic programming got me.
@@tear728 😂😂😂😂
@@tear728 damn lol
@@tear728 dp always gets everyone.
Waiting for - "Become software developer at Google in 14 minutes."
Lol
You nailed it at the end with the whole “learning” thing. I can’t believe colleges teach in ways that are so in depth, but don’t explain the bigger picture first. I’ve always learned best by seeing what the purpose of something is first, and then learning in finer detail.
Agreed big time, thats why people have a hard time learning maths or maths based methods because of "It is how it is" instead of explaining why do we do it.''
exactly thats how my brain learns, start with a difficult topic at an elmentary level and go down layers of abstraction on the topic until you get to the nuts and bolts of it. at each level make notes and slap them on flashcards, have them on you during work or whatever and when you go through them and take 20 secs per card to explain the question. By the time your a few layers down you look back and smile at the card notes you had to write out in those top layers, each layer produces more understanding and the top layer card answers now seem so obvious to you with the layerd knowledge you gained, adding in videos on the topic layers and your mind just starts building lasting connections to the info, well for me anyway..layer by layer, day by day..
aqreeeeee
The fact that you understood most of the things explained in this video after you've done your college part of studying on these concepts shows you that there is a possibility that you wouldn't be able to understand what's going on in these video if they showed you as a first lecture in college. Am I wrong? You think that this video is useful and that type of teaching method should come first before going into details but even what makes you understand this video is these details you've learned before watching it. Do you understand what I'm saying? How could you precisely estimate what would be your real reaction to that video if you watched it with 0 previous knowledge as a lecture on your first day of college? You're connecting ideas and knowledge you have while you're watching the video right now and then you say "OH! That makes sense." OF COURSE THAT MAKES SENSE BOY BECAUSE YOU KNOW THEM AND NOW YOU ARE REVIEWING THEM. These videos are good for reviewing your broader and deeper initial study but not to take as initial by itself.
@@sogan754 supplements and necessities. You don't take supplements firstly; necessities define the need of supplements.
“Dropped the dead weight”...DAMN Tren savage AF
Nero left the chat
who's the "dead weight" tho?
@Voltan, here's a hint, "Why I'm a dead weight (as a Millionaire) "
@@ImranHossain-by6nk Was not a hint till "as a Millionaire"
I'm 75% into a 60hrs Course of DSA......and its surprising how much of it you actually covered in this video.
Is it any good and if it is Mind sharing the course name?
@@rayjsuckdonkeydick4411 Mastering Data structures by Abdul Bari....on Udemy
It's kinda crazy how easy it is to teach DSA when the students actually underhand programming. I have taught this stuff to several students who are children, but I wait until they have been programming for a while and have a good grasp before introducing it.
It's not that DSA is super duper hard. It's that colleges teach it way too early. It'd be like jumping into calculus before learning algebra. (Or course colleges do that too with remedial math.)
@@Mathhead2000 Is it a must that I should know how to implement these data structures and algorithms from off the top of my head without looking anything up, or would just knowing about what they are and the use cases for each one (and the methods each collection support + their estimated time and space complexity) be good enough to get the job done?
@@thatoneuser8600 It depends. Generally speaking, you don't need to implement them in practice, because someone else has already done it. However, if you're trying to get a job, it's sometimes an interview question. I would say, it's good to know how to implement them, but you don't need to be a master at it.
So if anyone watching this is getting confused, try watching this after you have a basic understanding of programming (like the fundamentals of a programming language under your belt). This will make a ton of sense after that.
This is really well explained and packaged for you to UNDERSTAND what data structures and algorithms are. It's not for directly helping you solve problems.
More like come back once u know advanced maths concepts
Not gonna lie, but most people who came here already know DSA and just watched this for the vibe.
This video will only make sense if you already have a basic idea of what these data structures are.
@@horrid13th-cam.com/video/B7-ppAdHO80/w-d-xo.htmlsi=miQ06U1FKMzIDzki
This was recommended to me a few weeks ago and I was like WTF but just from clicking around and watching other stuff I almost think it's possible to understand, just not anytime soon 🎉
welp, there goes my career...
Drop haircare routine tho?
Not the first time White is defeated by Black
Career 🤣
@@satyakisarkar9123 😂😂😂
@@satyakisarkar9123 in a few more years all the Replies to this comment are going to be an _absolute hellhole_ .
Omg, you explain data structures better than my CS professor. (I am not joking btw)
he really did
@@uruseibaka9456 nah!!
@@universal4334 DAMARE BAKA
That's because your CS professor wants you to be able to mathematically prove with these properties. It's a different level of understanding.
i agree my professor jumped to recursion on our first day, and i feel like i would have been so lost without this video
bro, the amount of information in this video is f*cking with me. great job
I've been watching programming youtube videos for like 4 years now. A LOOT of them try to be funny. But man, you are the first one who is so good. I'm literally watching this just because its super funnny.
you have no idea how much knowledge this video contains untill you get a DSA course
7 hours of algoexpert reduced to 15 minutes
pls merge sort promo code Clem
I applied to Amazon and they told me to do an online test. I'm going to email them this video instead and tell them I watched it so they should just hire me.
i am watching this video every single day for my data structures and algorithms class...y’all wish me luck
THIS GUY TAUGHT US MORE THAN WHAT I LEARNT IN COLLEGE IN 16 minutes.....
Just a small word of encouragement from a software engineer without a degree: enough time and passion for programming will eventually turn you into a highly valuable specialist. Make it your hobby, and you'll enjoy most of the days of your professional career
or just attend college
@@mathbrah my personal experience with IT education system in my country was a mix of mostly bad stuff. I helped with programming implementation for a university graduate while still in middle school. And I dreamed to get into that university. Most of my former colleagues had a degree, yet a self-educated me was never lagging behind and even charged forward with important innovations. Also, many teachers force memorization instead of learning how things work, boxing one's creativity into a cage of poorly explained best practices. And let's not forget that higher education is often pretty damn expensive, especially in STEM.
Software development is creative work at its core. It evolves and moves forward so fast and university/college programme always plays catching up. I felt like I'm just wasting my time, and soon dropped out of my uni and scholarship. Pure passion got me to where I am in my life, and I have no regrets. College education is fine, but one can do great things without it too
@@Nekroido Ah I see. That is very sad.
@@mathbrah what exactly is sad?
@@Nekroido You loved programming, but in the place you lived, they all taught it wrong. Its sad seeing someone waste their potential like that. I'm still 15, and I'm learning from other people's successes and failures.
holy shit the editing and explanation is S-tier
Watched on 2x and learnt Data Structures in 7 mins 😎
Where do I find more educators like this on youtubeee, THANK YOU MANNNN
This is the best visually explained CS video I've seen yet🤧
This if the first video anyone should watch when learning Data Structures & Algorithms. Been watching a ton of videos, to barely grasp it and this one does such a good job of just defining it simply before getting bog down with applications -,-
I just used this video to prep for my Google interview and made it to the next round with your help. Thank you!
Watching this after finishing DSA college course and omfg... your visual interpretations of depth first search and breadth first search literally opened my third eye
14:02 about 5 years ago, my Java class talked about data structures for months and I remembered absolutely nothing. The professors really need to talk about ALL of the data structures we are going to learn and then make a comparison every single day before class if they expect the students to retain any information.
Very concise yet informative. Many others would spend 10 times as long to explain these concepts and not do as well at explaining. Fantastic!
You basically covered 75% to 80% of the content most 40-60 hours of DSA courses cover 😮!
I literally solved a few easy and medium problems based off your explanation and some research on wikipedia 🙌
as a cs student myself when at 3:20 you said "... has to be sorted" i got shivers down my spine. I'm having a design and analysis of algorithms class where we tackle some of the most known sorting algorithms and its fun, but boy can the assignments be hard
Thanks a lot man, I'm also a programmer and older than you, but I still learned/rememberd a ton from this video.
People like you inspire me to also bring more value to others, maybe I'll start a youtube channel myself one day, just teaching people the basics and who knows what else.
Have a great day everyone!
This video was not only good for newcomers but its also good for people like me, with shit memory, to brush up on concepts.
…And there goes my semester in 16 minutes
"Appending to a list is a constant time operation"
*Laughs in Computer Architecture*
lol
Now, I am curious.
this feels like such a nice refresher of everything I did in my algorithms class
I'm so glad I got to watch this before taking the class next semester, now I actually know what I'm about to get into and it'll be easier to understand the bigger picture. Thank you bro
Wtf, I legit thought the Jomaclass link was some sort of joke hahahahahahahaha
its pretty good for beginners.
same
Like just say you’re sponsored bro lmao
it is
Bro today is my DSA exam and TH-cam just recommends this on time. I just learned more than me 4 months Sem!!!! BROOOOOO u r LEGENDDDDDDD
As a math major who has to learn this on their own and also applies this method of “conceptual understanding first”, thank you. This is really awesome stuff.
have an interview in two days and i havent done much data structures or algorithms since I graduated college. this was a very good overall review.
This is the most knowledgeable advertisement ever existed.
One of the few that have understood how teaching should work dude. I have been thinking about for fucking YEARS. Great job man, u earned that sub
First semester econ student with the most math I've done being calc 1 and intro level stats, so way over my head. Nodding along for the watch time.
There’s not a lot of math in this video, it’s really just understanding terminology
I think this is the best video I've ever seen. Went through two semesters not understanding why it was important or how I could actually use it. Professors should just show this on the first day of class
Wow! How is it possible you squeeze all this in 15 mins and keep it engaging and relatable! Thumbs up from me!
shameless me clicked on a yt video to master dsa in 15 minutes... i well deserved it and i truly loved it.... where was this channel when i was getting bored during my college studies now that i have somehow finished the degree youtube i recommending me this stunning channel huh
I REALLY liked what you said about taking the big general idea of what you're learning first then diving deeper into it. I've had the same feeling towards that in teaching myself anything and the same frustration with the way my schools have taught. I've also described it as breadth-first learning
Dude covered my whole semester syllabus with revision ❤❤❤ thankyou a lottttt........
My month-long data structures class summed up in 16 minutes.
Currently learnign ds&a and coming back to this video every while or so to see how much more I understand. Such a satisfying feeling
I feel that this actually is a good representation of the class I took last semester. Some of that might have been because it was crap because online, but I feel like its much more important to have intimate knowledge of a small amount of ideas and be able to combine them than to try to memorize a lot of stuff in CS.
Like a lot of people struggled in this class, but most of them didn't seem to understand anything. On one exam we were asked to implement an obvious brute force = O(n) algorithm (given an array with some special properties, determine if N is in the array) and after we got grades back one guy posted that 'he figured out how to do it in O(nlogn) and was confused why he got a 0 for that. A bunch of other people seemed to agree with him that was unfair.
If you were in data structures with me, sorry for throwing yall under the bus btw
TL;DR 10:54 another interesting question is the longest degrees of seperation between any users on facebook. And of course the answer is infinity because I have no friends
I watched this video before I did Data Structures, and had no idea what he was talking about. Im watching it now after doing Data Structures and understanding everything.
Pro tip: Big O notation isn’t all that matters. A program I was working on originally used a hash map and it ended up being slower because the overhead of hashing my keys (which where just numbers) was more than traversing a binary tree. Always test for performance critical applications
Are you sure you weren't using c++ stl unordered map? Its known for being very bad
hello garet, my name is garrett. i’d like to offer you an extra r or t since yours seem to have been stolen
@@primitivecereal nah mine's spelled the right way
@@garethalliday833 understandable have a nice day
The example in 10:40 actually is great I’ve been thinking of this concept a lot without even connecting it to cs
“While a node with seven children is called a ***** my mother-in-law”
I got a 95% for DSA finals. But yet, I still didn't really grasp the concept of Time Complexity especially how do we calculate O(n log n). Until today, I randomly decided to check this video out at 10 AM with no sleep and finally got it. Thanks, u legend.
Not only is this video extremely informative- it’s also funny as hell
You really explained everything so well, I have already watched it 3 times, whenever my mind wonder for even less than 1 second I miss the flow, then I watch it again. I'll be back to watch this video again and once I have complete understanding of this video I'll write it in the comment. Thank you.
You should make more of these. This is awesome, similar to what I want to do with content creation once I finish building my app. Except I want to teach these things by building little apps and explaining different options so that I have a real problem in the program I'm making to point to.
I've watched this video a few times now, taken 4 pages of notes, and learning more off this one video than I have in college. Somehow I've became a TL without knowing any of this and now trying to pass any technical interview is becoming impossible.
JUNIORS, for the love of god. Don't do what I did and google your way through your challenges. Really learn and understand the basics before it bites you in the ass
"...But I found situations where BSTs really shine are......when you are asked questions about BSTs!" Hilarious! :D
Literally my entire semester-long Data Structures course..... in 15 minutes.. nice!
Everything went over my head. I need to slow down this video, then branch out and learn about each word.
Aye dude this is the first video of yours I've stumbled across and you just backflipped into the intro after calling the tech industry cancer, and calling this video the cure. Subbed for that alone. Absolute Gigachad.
Thats a really good overview of data structures wasnt expecting lmao
I got recommended this an hour before my final exam. God bless
I watched your troll videos before, so I clicked this expecting more shenanigans, but not only did you surprise me, but you explained phenomenally well, like better some college professors I had.
Dude this is so great. I learned more in this than I have watching hours of otherwise boring content. I learned, I laughed, and more importantly I *understood* . This is pure gold !!
Awesome vid! Just wanna add: In pathfinding Dijkstra's alg is inefficient cuz it traverses all nodes which is incredibly slow but it can find the shortest path to all nodes. Something like A* is more efficient since it goes through nodes that are closer to the end node and doesn't bother with the rest.
I watched a 8 hour video on data structures and algorithms but I more understood by this video by you,salute to you.you helped a lot
I love this video! I understand it really easily. I just don’t like how fast it is, I think just a tad bit slower makes a lot of difference. Needed to pause and repeat because sometimes I did not understand the word he said. But overall, much better video compared from a ton of explanations in TH-cam. Good job! Love it
Even though I didn't learn these subjects, now I know what to learn. I hope I will be able to come here again and type "I learned." after I get it done.
4:03 Interesting note: there actually are algorithms that can sort in O(n) time, although they're not often used. Radix Sort and Counting Sort are two examples. It's specifically comparison sorts (where you compare individual elements against each other, like Quicksort and Insertion Sort) that can never be faster than O(n logn).
Radix is often unused because of its overhead, making it inefficient for lists shorter than hundreds of thousands of elements.
@@Sam-vf5uc oh ok, because when you see radix sort on algorithm visualizations, it beats the sh*t out of the other algorithms 😄
He specified "an arbitrary collection" tho.
Saved this to see if i can get what you're saying after 2 months
Actually, Count sort and Radix sort operate with a complexity of O(n) making them the most efficient sorting algorithms, it's just that special circumstances must be fulfilled to use them :D
Exactly, it's specifically comparison (sorts like Quicksort and Insertion Sort) that can never be faster than O(n logn)
@@benjaminphilippe2810 yes, but again quick sort has a wider spectre of usage than count sort, so it really depends of the situation
He specifically qualified the statement for "an arbitrary collection"
Took both courses i love it when I can relate to everything you said
This is really one of the best summations of the work that I have ever seen and I have a Bsc computer and statistics degree. Good job man.
thats actually my 3 year BTech course so far and now I understood what they were trying to say....
Need you at college Professor
This was so well done man!! Those adjacency matrices are the same thing as transition matrices in markov chains, very interesting !
Thank you I learned nothing in my class but ur video saved me
See, this is the type of content I subbed for.
dude fire video this is what the CS community needs, props to you ong
0:15 bro that Hooli rejection email was on point lmao
I first thought it as a joke, but I need to appreciate your effort. Thanks for making DSA a little bit easier.
I have been trying to understand logarithmic complexities for a while, your explanation was so on point it only took a me a mere 30 seconds for me to understand it
HUGE THANKS, LIKE SERIOUSLY, THANK YOU
thank you now I can finally pass my data structures and algorithms exam with a perfect score
Learn DSA and watch this video .75x speed 2 times, its a good revision
Edit: wrote this ☝️ before watching whole video, now I think I should have watched this before starting DSA then after that
Bruh this is one of the best videos I've watched this year, actually helpful and funny AF love it
Imagine Techlead watching this lol
Man, I needed a refresher for my job interview tomorrow. You saved me!
Damn you working with Joma now after you roasted him lol
Edit: Ahh I spoke too soon. That's good that he took the criticism and is improving himself.
hahahahahaha
The fact that he called him a sellout and is now taking money from him. The irony is too sweet 😂
@@TrenBlack I have a question that would likely not get a honest answer if I am wrong, did Joma pay you? And what do you really think about Joma class?
@@Red-yq6nc he probably did... But that doesn't mean his course isn't good... It's actually the best data structures course I've seen in my entire life and I would highly recommend it if u have the money
*Telling u as a fellow Itachi fan* XD
@@tusharsrivastava370 Shisui>Itachi
by far the best video on DS and algo in youtube
I always confuse Zyzz with Tren when using the mirin' hash function
Yeah i too confuse it.
Dude I love you hahahaah I come here to study because I am super nervous for an interview and your video is so awesome, super fun and helpful, thank you
I had a headache before watching this, now I can't find where'd I put my brain.
OMG this video explains my entire Data Structures course of this semester......
Hey, you kinda missed maximum subarray sum, sets, backtracking, meet in the middle, longest increasing subsequence, the knapsack problem, edit distance (or the Levenshtein distance), two pointers method, sliding window minimum, binary indexed tree (also known as BIT or the Fenwick tree), segment trees, greedy algorithms, dynamic programming, the bellman-ford algorithm, the floyd-warshall algorithm, a tree's diameter, kruskal's algorithm, union-find structure, prim's algorithm, cycle detection in graphs, connectivity check for graphs, kosaraju's algorithm, 2SAT, offline and online algorithms, eulerian paths, hamiltonian paths, the ford-fulkerson algorithm, the trie, the z-algorithm, mo's algorithm, lazy propagation, the convex hull problem, and sweep line algorithms.
I learned maybe two of those in my data structures course, and dynamic programming was touched on in Fundamentals II.
It's a 16 minute video bro
bro... if you watch a video on youtube which says "_____ in 15 minutes" you can rest assured that it's not going to cover 12 hours worth of content.
@@ooffoo5130 Guys I know we're cs majors but I think he may be making a joke!
I learned most of these in my discrete structures and Algorithms course
This is the most exciting summary of DS and Algos I have ever seen. Well done! 😊
Data structures is not a sprint but a marathon ... Go and study👍
I'm almost close to finish CS50 and this video covers a lot of topics that I wish if I knew before so I can have better understanding but well done bro nice video very informative