Data Structures - Computer Science Course for Beginners

[@NullPointerException]

Thanks again for the opportunity! Absolute pleasure working with you guys on this -Steven (NPE)

[@sadiqhussain9202]

Your explanation is on another level. Thank you so much Steven

[@Trazynn]

You can actually write "With @NullPointer Exception " in the title and it becomes a clickable link. IN THE TITLE. New KZbin feature.

[@Jihed]

I liked your teaching style and your sense of humor, I encourage you to keep going

[@fadidabari9618]

Thanks for your great contribution 👍

[@slmshady539]

Amazing work, I am halfway through it and I am loving every minute of this video. I wanted to watch DS and Algo in JS but after getting the basics from your video, I don't think understanding it all specific to JS will be a tough task. Thanks, great work once again.

[@DxDy777]

20:23 Array 43:32 ArrayList 1:05:02 Stack 1:18:03 Queue 1:28:18 LinkedList 1:47:20 Doubly-LinkedList 2:00:22 Dictionaries 2:16:40 Tree 2:29:02 Tries 2:38:27 Heaps 2:48:17 Graphs

[@210animeshsawant8]

thanks bro ❤🙌

[@aminblm_german]

Timeline 00:00 Introduction 01:06 Timestamps 01:23 Script and Visuals 01:34 References + Research 01:56 Questions 02:12 Shameless Plug 02:51 What are Data Structures? 04:36 Series Overview 06:55 Measuring Efficiency with BigO Notation 09:45 Time Complexity Equations 11:13 The Meaning of BigO 12:42 Why BigO? 13:18 Quick Recap 14:27 Types of Time Complexity Equations 19:42 Final Note on Time Complexity Equations 20:21 The Array 20:58 Array Basics 22:09 Array Names 22:59 Parallel Arrays 23:59 Array Types 24:30 Array Size 25:45 Creating Arrays 26:11 Populate-First Arrays 28:09 Populate-Later Arrays 30:22 Numerical Indexes 31:57 Replacing information in an Array 32:42 2-Dimensional Arrays 35:01 Arrays as a Data Structure 42:21 Pros and Cons 43:33 The ArrayList 44:42 Structure of the ArrayList 45:19 Initializing an ArrayList 47:34 ArrayList Functionality 49:30 ArrayList Methods 50:26 Add Method 53:57 Remove Method 55:33 Get Method 55:59 Set Method 56:57 Clear Method 57:30 toArray Method 59:00 ArrayList as a Data Structure 1:03:12 Comparing and Contrasting with Arrays 1:05:02 The Stack 1:05:06 The Different types of Data Structures 1:05:51 Random Access Data Structures 1:06:10 Sequential Access Data Structures 1:07:36 Stack Basics 1:09:01 Common Stack Methods 1:09:45 Push Method 1:10:32 Pop Method 1:11:46 Peek Method 1:12:27 Contains Method 1:13:23 Time Complexity Equations 1:15:28 Uses for Stacks 1:18:01 The Queue 1:18:51 Queue Basics 1:20:44 Common Queue Methods 1:21:13 Enqueue Method 1:22:20 Dequeue Method 1:23:08 Peek Method 1:24:15 Contains Method 1:25:05 Time Complexity Equations 1:27:05 Common Queue Uses 1:28:16 The Linked List 1:31:37 LinkedList Visualization 1:33:55 Adding and Removing Information 1:41:28 Time Complexity Equations 1:44:26 Uses for LinkedLists 1:47:19 The Doubly-LinkedList 1:48:44 Visualization 1:50:56 Adding and Removing Information 1:58:30 Time Complexity Equations 1:59:06 Uses of a Doubly-LinkedList 2:00:21 The Dictionary 2:01:15 Dictionary Basics 2:02:00 Indexing Dictionaries 2:02:40 Dictionary Properties 2:05:53 Hash Table Mini-Lesson 2:13:26 Time Complexity Equations 2:16:39 Trees 2:16:55 Introduction to Hierarchical Data 2:18:54 Formal Background on the Tree 2:20:03 Tree Terminology and Visualization 2:25:08 Different types of Trees 2:28:07 Uses for the Tree 2:29:00 Tries 2:29:50 Trie Basics 2:30:41 Trie Visualization 2:34:33 Flagging 2:35:15 Uses for Tries 2:38:25 Heaps 2:38:51 Heap Basics 2:39:19 Min-Heaps 2:40:07 Max-Heaps 2:40:59 Building Heaps 2:44:20 Deleting from Heaps 2:46:00 Heap Implementations 2:48:15 Graphs 2:49:25 Graph Basics 2:52:04 Directed vs. Undirected Graphs 2:53:45 Cyclic vs. Acyclic Graphs 2:55:04 Weighted Graphs 2:55:46 Types of Graphs 2:58:20 Conclusion 2:58:43 Shameless Plug

[@aminblm_german]

@Defiant Duck you are very welcome !

[@yamannashawati7524]

Shameless plug. LOL

[@goodperson7427]

It's given in the description too

[@sammygamer5733]

God bless you

[@LuisHernandez-li4fy]

Hero

[@renishparghi]

This 3-hour video is my Entire 2 semester of my Computer Engineering!! such nicely composed Video. Definitely recommend for beginners! Cheers!

[@lisafleming9603]

Renish Parghi, Thank you for refreshing my learning zest!

[@curiosdevcookie]

@Renish Parghi: that strikes me as kinda slow going! Would you mind telling me if you with hindsight say that it was overall worth it to go to University to study Computer Engineering? Or not needed anymore due to such expertly done content like that? My brain seems to enjoy theoretic subjects in CS the most and to think about Datastructures & Algorithms feels somehow noble and pur; most combinations are also just so beautiful…😄🤟🏽 Being a university certified nerd turned out to be a one shot thing for me as I could find only one single tech-related Master („Digital Humanities“ ) … In at least all of Germany… that I’m allowed to study with my cultural BA in History. I’m open to and very grateful for anyone’s educated advice, in any direction: Is the professional side of going to university, i.e.the content, the ways of teaching, …and finally the graduation certificate… still worth it or even needed nowadays?

[@renishparghi]

@@curiosdevcookie Hello. . . I hope my detailed review could help any person who has the same dilemma as you!! I have a couple of reasons why I wrote that comment. . . 1) When we say computer skills (that practiced and recognized in the market by any IT company) is greatly lacking in our curriculum! 2) The topic we learn in college and what we do in the actual scenario - is way different! 3) Time it took to complete some topic in one term, was equivalent to 30 minutes of this video! And I think, when it comes to learning such a technical topic, the pace is important! 4) What I feel, the fees I paid for, for learning these skills. ARE FREELY AVAILABLE ON KZbin! AND NOT JUST FREE, I WOULD SAY UPDATED TOO! -If I got a chance to not attend college and watch this channel and get updated skills and then apply for an internship or job, I would do that happily! (I am not diminishing the importance of college. that's whole another topic to discuss. ) ​​​​​​ I would happy to know your take on this point!! please let me know!! :)

[@koushikroy6259]

@@renishparghi I completely agree with you. I am an Electrical Engineer and currently working as a data scientist. Also, I'm involved in some projects in the Application of Deep Learning in Computer Vision Tasks. I feel like my entire undergraduate period was a complete waste of money and time. I wish I could get that back. For anyone trying to decide between a university degree or a self-learning path, at least in the software or data science industry the skill is the most important factor. How you gained it, is irrelevant.

[@tomjerrytomjerry7154]

@@koushikroy6259 can l please know how to become a data scientist???? And also If you have idea about Learning data science .. please sayyy... And regarding skills i've a doubt... How to develop them?? Please say 🙏

[@kameshparashar]

This guy taught me C++, Python and now DS. He's truly amazing.

[@patrickzhao9072]

+ for free yooooo

[@prabhuraam5271]

From where u learn c++ ..I want to learn

[@houfame]

C++! give the links to his videos?

[@SayakKolay]

Can anyone post the links for the above mentioned C++, Python videos ?

[@TheJerzke]

@@prabhuraam5271 kaikki blogit

[@NOCDIB]

I graduated with my BS in Computer Science 16 years ago and, I must say, this video is a good conceptual refresher.

[@WiLDbEAsTGameSHere]

I am 16 years old and I have 3 years of programming exp. :p

[@EOMMunaware]

⁠@@WiLDbEAsTGameSHereProgrmming and computer science are not the same. Computer science involves much more theory, and heavier math than programming.

[@WiLDbEAsTGameSHere]

@@EOMMunaware well still I have 5 years of prior programming exp and am still 18 ;p [you can atleast think that I might know about these concept because I do]

[@treyquattro]

34:25 - two-dimensional arrays are by default row, column. The programmer can address a 2- or n-dimensional array any way they want (so long as the indices are within bounds) but the convention is array[row][column] not [column][row]. Using anything other than [row][column] will confuse other programmers and probably lead to errors. [2][2] was a bad example because it will result in the same element being addressed. Elements [2][1] and [1][2] are different ("Marcus" and "Quinten" by conventional addressing).

[@rezan6971]

C family multidimensional arrays are row-major ordered

[@smUser8990]

Thank you... I also noticed it

[@Rubenvaldo]

yeah, I noticed that too. And also when mentioning inserting/deleting elements to/from an ArrayList (53:22), the index comes before the object in both Java an C#, not the other way around, right? (C# : public virtual void Insert (int index, object? value), (Java : public void add(int index, E element));

[@bytekast]

Yes. This video has so many flaws, inaccuracies and incorrect info that I had to stop watching it midway. I couldn't stand it, the bad parts were more serious than the great ones. I can't understand why some Indians there are finding it good. Guess they are beginners who love free content. There's even a senior developer liking it, wtf? I guess we really are better off with a book, guys. Or with a site like WikiBooks or Wikipedia, which are very thorough and well-written, unlike those shitty "tutorial" sites.

[@silentlessons4221]

just 20 minutes in and I realise i struggled with this concept at university for an entire semester solely because of the way the lecturers taught. Many thanks indeed for this

[@rickli84]

3 hours video and totally free! I have to pay about $2200 in Australia for these if I wanted to learn this from a Uni, thank you very much!

[@shervinmokthari1251]

35 mins in, i am absolutely engrossed & loving the concise breakdown. Much love!

[@shervinmokthari1251]

world class joke about the completely random words that filled up the stack! 1.10.00

[@strictnonconformist7369]

I’ve recommended this to my 40+ years-old friend that decided to learn to code in C++ (hell of a first language, like juggling flaming chainsaws while on a tightrope over a pool of hungry sharks) after my Comcast cable app on autoplay through this up while I was sleeping, and I woke up in the middle of it. I wish I had run into this decades ago when I first started! This video has clear oration at an appropriate pace, great graphics, and covers a lot of data structures and where they’re used in a logical manner. Some people do best with graphical teaching, some with words, this appears to cover a fair number of learning styles: now students just need to learn by doing, but at least this is a great (and FREE!) audiovisual lecture, that can easily be rewound to desired spots (and the description has a nice time reference table of contents) for what they want to review.

[@rishikumarjha3616]

Free code camp is heaven for us ....who can't pay on some online courses

[@Trazynn]

Most paid online courses aren't that great either. Udemy and Skillshare have a lot of garbage. Pluralsight is decent, same level as FreeCodeCamp but with more niche tutorials.

[@Saffeyah]

I think online courses are good to have someone 1on 1 evaluate your code and teach you technique

[@BetaNegative]

Thank goodness! I almost subscribed to Coursera, but decided not to since some users had unauthorized charges or ungraded assignments. The aggressive monetization with the "take high-quality courses for free (TRIAL)" rhetoric was also a bad sign.

[@ritalaurennoel4584]

@@BetaNegative Well, I will say it's hit or miss. I took the SQL specialization, which covered 4 courses. The first course was fantastic for me to learn basic SQL, and I absolutely thought it was worth it. However, the second course (AB testing) was so frustrating that I didn't finish it. I think it really depends on which teacher sets up the class, and that's why it's so inconsistent unfortunately.

[@omirospavlou7607]

Well I mean you can pay 20 dollars for a couple of courses

[@kia808]

Wow, it's the best teaching video, for a non computer science background student, you make it easy to understand everything.... Thank you so much 😊😊😊

[@AP-pm9qy]

This is a minor point but at 27:13 you can also create an array in Java using the C# syntax. In fact, that is the more conventional way to do it in Java.

[@azeez8399]

Great bootcamp. I'll be putting small recommendations to tweak and mildly improve your slides in this comment. [14:55] - Switch the O(n) and O(log n) so there is a proper progression from fast to slow as you move left to right. [21:45] - Typo: Delete extra word "in". [30:10] - It may be a good idea to note that in Java both "int array[] =..." and "int[] array =..." are acceptable ways to declare and allocate memory to the array. [33:57] - I recall from my C++ class that when accessing the elements of a matrix A, it's row, then column as in A[row][column]. 🤔 [55:45] - As the Java ArrayList get() function is lowercase, it makes sense to type it in lowercase in the blue box for consistency.

[@trollface1994]

Nahh, ur suggestions are Wac bro. I like it as it is. why not make ur own video, if you're so critical.

[@kannalix-amsmhss4369]

⭐️ Course Contents ⭐️ 💻 (00:00) Introduction ⌨️ (01:06) Timestamps ⌨️ (01:23) Script and Visuals ⌨️ (01:34) References + Research ⌨️ (01:56) Questions ⌨️ (02:12) Shameless Plug ⌨️ (02:51) What are Data Structures? ⌨️ (04:36) Series Overview 💻 (06:55) Measuring Efficiency with BigO Notation ⌨️ (09:45) Time Complexity Equations ⌨️ (11:13) The Meaning of BigO ⌨️ (12:42) Why BigO? ⌨️ (13:18) Quick Recap ⌨️ (14:27) Types of Time Complexity Equations ⌨️ (19:42) Final Note on Time Complexity Equations 💻 (20:21) The Array ⌨️ (20:58) Array Basics ⌨️ (22:09) Array Names ⌨️ (22:59) Parallel Arrays ⌨️ (23:59) Array Types ⌨️ (24:30) Array Size ⌨️ (25:45) Creating Arrays ⌨️ (26:11) Populate-First Arrays ⌨️ (28:09) Populate-Later Arrays ⌨️ (30:22) Numerical Indexes ⌨️ (31:57) Replacing information in an Array ⌨️ (32:42) 2-Dimensional Arrays ⌨️ (35:01) Arrays as a Data Structure ⌨️ (42:21) Pros and Cons 💻 (43:33) The ArrayList ⌨️ (44:42) Structure of the ArrayList ⌨️ (45:19) Initializing an ArrayList ⌨️ (47:34) ArrayList Functionality ⌨️ (49:30) ArrayList Methods ⌨️ (50:26) Add Method ⌨️ (53:57) Remove Method ⌨️ (55:33) Get Method ⌨️ (55:59) Set Method ⌨️ (56:57) Clear Method ⌨️ (57:30) toArray Method ⌨️ (59:00) ArrayList as a Data Structure ⌨️ (1:03:12) Comparing and Contrasting with Arrays 💻 (1:05:02) The Stack ⌨️ (1:05:06) The Different types of Data Structures ⌨️ (1:05:51) Random Access Data Structures ⌨️ (1:06:10) Sequential Access Data Structures ⌨️ (1:07:36) Stack Basics ⌨️ (1:09:01) Common Stack Methods ⌨️ (1:09:45) Push Method ⌨️ (1:10:32) Pop Method ⌨️ (1:11:46) Peek Method ⌨️ (1:12:27) Contains Method ⌨️ (1:13:23) Time Complexity Equations ⌨️ (1:15:28) Uses for Stacks 💻 (1:18:01) The Queue ⌨️ (1:18:51) Queue Basics ⌨️ (1:20:44) Common Queue Methods ⌨️ (1:21:13) Enqueue Method ⌨️ (1:22:20) Dequeue Method ⌨️ (1:23:08) Peek Method ⌨️ (1:24:15) Contains Method ⌨️ (1:25:05) Time Complexity Equations ⌨️ (1:27:05) Common Queue Uses 💻 (1:28:16) The Linked List ⌨️ (1:31:37) LinkedList Visualization ⌨️ (1:33:55) Adding and Removing Information ⌨️ (1:41:28) Time Complexity Equations ⌨️ (1:44:26) Uses for LinkedLists 💻 (1:47:19) The Doubly-LinkedList ⌨️ (1:48:44) Visualization ⌨️ (1:50:56) Adding and Removing Information ⌨️ (1:58:30) Time Complexity Equations ⌨️ (1:59:06) Uses of a Doubly-LinkedList 💻 (2:00:21) The Dictionary ⌨️ (2:01:15) Dictionary Basics ⌨️ (2:02:00) Indexing Dictionaries ⌨️ (2:02:40) Dictionary Properties 💻 (2:05:53) Hash Table Mini-Lesson ⌨️ (2:13:26) Time Complexity Equations 💻 (2:16:39) Trees ⌨️ (2:16:55) Introduction to Hierarchical Data ⌨️ (2:18:54) Formal Background on the Tree ⌨️ (2:20:03) Tree Terminology and Visualization ⌨️ (2:25:08) Different types of Trees ⌨️ (2:28:07) Uses for the Tree 💻 (2:29:00) Tries ⌨️ (2:29:50) Trie Basics ⌨️ (2:30:41) Trie Visualization ⌨️ (2:34:33) Flagging ⌨️ (2:35:15) Uses for Tries 💻 (2:38:25) Heaps ⌨️ (2:38:51) Heap Basics ⌨️ (2:39:19) Min-Heaps ⌨️ (2:40:07) Max-Heaps ⌨️ (2:40:59) Building Heaps ⌨️ (2:44:20) Deleting from Heaps ⌨️ (2:46:00) Heap Implementations 💻 (2:48:15) Graphs ⌨️ (2:49:25) Graph Basics ⌨️ (2:52:04) Directed vs. Undirected Graphs ⌨️ (2:53:45) Cyclic vs. Acyclic Graphs ⌨️ (2:55:04) Weighted Graphs ⌨️ (2:55:46) Types of Graphs 💻 (2:58:20) Conclusion 💻 (2:58:43) Shameless Plug

[@ShadaeBalancesKnightAstro]

You’re awesome, thank you 🙏🏾

[@TheOceanLoader]

Having been a senior developer for some 15 years now, I still found this a very useful recap and great at articulating certain salient points. Thank you!

[@bytekast]

Yes, it's great to review the basics at some points, like the ones about BigO, array type and size and stack operations. But it's got seriously flawed information at some other parts, like suggesting Python supports arrays and calling dynamic arrays "ArrayList", and this is harmful for beginners! Even I, who am not even a junior developer, could spot that. I am sure you did too, if you really are who you say you are. I would say beginners are better off with a book, a college course or a WikiBooks tutorial. I wouldn't recommend this video to anyone who, unlike you, doesn't know the basics by heart.

[@TheOceanLoader]

@@bytekast I agree with what you said about there being some things wrong but C# and Java have some overlapping object names. I think this is C# not Python?

[@alfonstabz9741]

pls don't skip the commercials in this video it's our way of helping this teacher..!

[@acestandard6315]

Never in my life have i completed course as long as three hours. Thanks for sharing.

[@BRYANCASTANO-y4g]

This Video Is AMAZING for beginners on Computer Sciences. highly recommended to watch it all time long. it definitely worth's the 3 hours. as highly education.

[@Rin-qj7zt]

19:42 a note here about this "other functionality." this is why "intermediary data structures" can be so useful. some structures can read really quickly, but with large data sets can take a long amount of time to set up due various factors in the system being programmed. so it may be beneficial to first create one structure because it's fast to populate(probably when data doesn't have to be modified to populate it), use it for a few tasks, and then later populate the second structure using reads from the previous structure to create a something that can be accessed many times in quick succession at the time that you need to do that. This way, your program smartly adapts to the kind of work that needs to be done on the data in question depending on what kind of work needs to be done on it. This will show the best results when a program is using large data sets for a variety of different things at different times.

[@honeysharma8643]

Watching this 3 years after completing my engineering, and now I understood all of it.Thanks for this great content.

[@aparnamahalingam1595]

This was the first and ONLY video tutorial that I stuck around to watch in its ENTIRETY on data structures, because I genuinely needed the knowledge. Well done. Very awesome explanations; the use cases were especially splendid!

[@babrakoskei6134]

I like how you talk slow but aren't boring. I've always wondered what the big O notation means and now I do

[@proxyvert8976]

Very informative, info per second is 100x densier than in C++ courses that I studied at university.

[@jonahrivera7]

This video is so underrated. This is exactly what I needed for my Data Structures class. Thank you my braddah you are the man!!!!

[@WilsonLee123]

It's amazing that anybody with an internet connection (and uncensored bandwidth 😶) can access technical information like this. Not long ago at all, we'd all have to be in the right place, around the right people, in order to find out about how things work. Often, paying a lot of money to do so too.

[@ShadaeBalancesKnightAstro]

I think this often when connecting with incredible people online, remarkable.

[@rajmashalkar]

Thank you so much for this wonderful video.. Literally what I learnt data structures in this 3 hours, never in 6 year of my computer science engineering diploma and degree

[@amaze2n]

1:15:15 small correction, the stack is Last In, First Out (LIFO). Not FIFO.

[@gabrielfono844]

I just watch the introduction Amd I know I will worth my time. Thanks for this course I am self taught

[@emadmahmoud7]

your method of explaining concepts is insane, I watched lots of videos on data structures besides taking it now at my college I can say you are away way better when it comes to explaining these stuff, thnx a lot : )

[@timothymaruti2165]

This is really enlightening,one of the best way the data structures has been unpacked.good job

[@7own878]

2:56:06 You contradict yourself there. An Undirected Graph can't be Acyclic. You say that a minute before. This is really ranting with the highest standards. Amazing video! I learned so much. Thank you a lot!

[@sumanthhegde5148]

The effort that went into this, the quality of the content and the presentation... Just REMARKABLE! Looking forward to learn a lot more from you. Thank You!

[@mccama19]

I'm so glad this information is available to everyone for free! I wish this had been available when I was in college.

[@khytron06]

im not even in high school yet

[@maiahmed9711]

Free code camp..way to go ❤❤❤ With love from Egypt 🇪🇬

[@lindseyb1445]

Came across this video on accident… this is the best explanation I’ve seen so far! Thank you so much ❤️

[@joneswafula]

Very engrossing. The video is broken down to very simple forms that makes it quite a joy to watch through. Thanks man, you're a great teacher! 😊

[@amahlejenete8501]

Have not seen/found any other video better than this one on Data structures. A definite must watch!

[@WickedTwitches]

I cry when I see these videos and think about how much I have yet to understand. Thank you for them.

[@trollface1994]

wuss.

[@inponderland]

Steven, this video was awesome! You clearly put a lot of preparation into your lessons, and the slide visuals are top notch compared to most other CS educational videos. You definitely earned a subscriber

[@sagarikahiremath2690]

It was worth watching without wasting time you did good job👍

[@theegreatestever2420]

First of all thats an absolutely amazing thumbnail! Cant wait to learn from this

[@ScottPlude]

@23:00 an array DOES NOT have to contain integers OR strings. It is very common to have an array with both datatypes. I do it all the time.

[@user-wc1sm8cj8s]

A great tutorial sir! This is the only place on the web where I really understood this topic of all the free learning resources out there. I've been waiting for your Algorithms Tutorial btw. Thanks!!! (Guys, I think we'd better support this dude, let's subscribe to his channel to say thanks)

[@thomaspynchon8400]

This is without a doubt the best data structure course in this channel.

[@davidwylie9775]

I know that this video is old. I think when you are referring to 2d arrays you have things backward timestamp 34:37 the slide and how you describe it. You refer to the first number as the column and the second as a row. It should be row and then column [1][0] when trying to get adam. I'm only 35 mins in and am really enjoying the explanations. Just thought I'd point this out for people that may not know.

[@sastianp]

Dziękujemy.

[@KrakkeX]

Dude, I just want to say thank you! your video its like a TL; DR and that's awesome!!! just thank you!

[@abrahambaffoe7402]

Awesome dude. You made it easier and very advanced.. Thank you. Looking forward for more hint..

[@mahmudurrashid9035]

I should've come here sooner, wouldn't have wasted so much of my time that way. Awesome explanation!

[@everybot-it]

I could 'forgive' vertexes as plural, but one is a "vertex". They're stored in a separate data structure of nouns with weird plural forms that have no pointer to the other objects. You have to know the key. Awesome tutorial! BTW, I think the spell checker algo also needs knowledge of keyboard positions, to estimated-guess where a fat finger might have slipped. Which makes this even more complex. Advanced mode would be trajectory awareness, as a similar and paralel system to tries based word completion. Then again, it would be interesting to test at which point of error-density (eg constantly missing keys) while autocorrection correctly taking over it would still be "somewhat uncomfortable" (a feeling of not being in control etc). I think autocorrection should never intervene within word boundaries but wait for the space bar. Suggestion and autocorrection must be separate. Context-awareness is the gold mine for suggestions, and to some degree also for AC. This is where I feel even advanced systems, like my trusted Google Pixel keypad, still struggle a lot. So many times I caught the system not being topic or context aware, offering more or less probability based stuff, not logical items, that fit that context or topic. Here I see great potential for improvement.

[@alialrahem9817]

Thank you so much for the course l did attend the class for data structure in college but l never understand the subject with your video everything is clear

[@raghavsaurav788]

M

[@suryaajha2142]

For 2D arrays we index element by arr[row][col], the instructor says the first index is col and the second one is row, that might be not right at least for Python, Java, or C

[@gsb22]

Neither for C#, JavaScript, TypeScript

[@devanarayanababu1996]

ive only reached 6:30 but i can already tell that im going to enjoy this lecture!

[@mayxx2105]

Thank you for this vid. It's actually a great timing coz I'll be taking data structures for my class probably next week. A great start for beginners like me. ❤

[@fayebradshaw4221]

The narrator is amazing, I chuckled several times, very witty

[@iamnimish]

Completed. Thank You FCC.

[@alexmcd378]

Listening as a refresher. It's been so long, I've forgotten half of the types and almost all the names. Which leads to reinventing the wheel unnecessarily

[@gaddp]

the funniest and the most entertaining data structure lecture in the world.

[@mthokozisimtolo8910]

This content is just brilliant. Thank you for the concise and meaningful work!

[@vikrantambekar3394]

You guys should get a oscar for providing knowledge without money Many people wants this who cant buy courses but can learn through your videos

[@FullHeartMommy]

I watched this entire video and everything was explained so clearly. Thank you!

[@keepsecret7624]

This needs a PDF! Reading is - at least for me - is important to learn and revise

[@bindassplay5114]

May God bless you guys, I am very grateful😊 , I hope to help other guys too I have I am able to

[@eduardotrujillo9316]

Really an amazing resumen. All concepts very easy to understand from the root process.

[@surajdbhat4842]

In Ruby you can store any type of data in array need not be same data type and also no need to specify the length of an array

[@jwilliams8210]

That was an absolutely fantastic exposition to Computer Science!!!

[@ravigadadi6207]

Great resource !How can someone dislike this good Content! Maybe some who are selling the course materials..

[@oscarwang7920]

Thanks a lot ! this is way better than the 4 months course from my school

[@D3Jia]

God bless you sir for the wonderful explanation + the Black background!

[@GulliversCovers]

Fulfilling presentation, FCC 👍 Looks so awesome! Elated to be here! Keep up the wonderful work Friend! Have a spectacular Sunday 🥰

[@trollface1994]

the FCC won't let me be ...

[@JameS00989]

Thanks What an exceptional video for introduction to Data structures kudos to you

[@dpduy4625]

best things ive managed to learn

[@mumk]

I really appreciate the entire presentation, it must be taking a lot of effort to complete, thanks!

[@bongbong3871]

This channel is the best I have subscribed so far. Thank you very much!!!!

[@nishantbanjade920]

OMG , I can't believe , Today i failed in my DS /Algo test Now i am gonna win

[@caniget600subscriberswitho5]

Me2

[@peppermintdior]

i struggled soo bad!

[@alkalomadtan]

n^2 and 2^n are completely different complexity categories. The first one is polynomial (P class), the second one is the one which is exponential (NP class). One of the ultimate questions of computational math that if P = NP. If it is so then cryptographic algorithms are at danger.

[@silhouettefalcon1659]

Darn it. A complex topic became understandable. Its magic!!

[@KrishabBashyal]

Thank you so much for the value and information, loved the content. Thank you so much!

[@mohammeds6314]

THANKS,I love your way of teaching.

[@jAI0102]

Some points not to miss,.. Data structures are fundamental components of computer science and programming that enable efficient storage, organization, and retrieval of data. They provide different ways to store and manipulate data, depending on the requirements of the problem at hand. Here are some key data structures: 1. Arrays: An array is a contiguous block of memory that stores elements of the same data type. Elements are accessed using their index. Arrays offer fast access but have a fixed size. 2. Linked Lists: A linked list is a collection of nodes, where each node contains a value and a reference (or link) to the next node. Linked lists provide dynamic size and efficient insertion/deletion, but accessing elements requires traversing the list sequentially. 3. Stacks: A stack is a Last-In-First-Out (LIFO) data structure. Elements are added or removed from the top only. It follows the "push" (add) and "pop" (remove) operations. 4. Queues: A queue is a First-In-First-Out (FIFO) data structure. Elements are added at the rear and removed from the front. It follows the "enqueue" (add) and "dequeue" (remove) operations. 5. Trees: A tree is a hierarchical data structure consisting of nodes connected by edges. Each node has a value and may have child nodes. Common types include binary trees, binary search trees, and balanced trees like AVL trees and red-black trees. 6. Graphs: A graph is a collection of nodes (vertices) connected by edges. Graphs can be directed or undirected and can have weighted or unweighted edges. They are used to represent relationships between objects. 7. Hash Tables: Hash tables (also called hash maps) use a hash function to map keys to array indices, allowing efficient key-value storage and retrieval. They provide constant-time average-case complexity for insertion, deletion, and search operations. 8. Heaps: A heap is a binary tree-based data structure with a specific ordering property. It is commonly used to implement priority queues, where the highest (or lowest) priority element is readily accessible. 9. Tries: A trie (prefix tree) is an ordered tree-based data structure primarily used for efficient string retrieval. It allows for fast prefix-based searches and is often used in applications like autocomplete and spell-checking. These are just a few examples of data structures, and there are many variations and combinations depending on specific needs. Understanding the characteristics and trade-offs of each data structure is essential for selecting the appropriate one for a given problem or algorithm.

[@nawalnitsua8893]

Thank you!

[@ShadaeBalancesKnightAstro]

Thank you for teaching these concepts, greatly appreciated!

[@dariusdubose5920]

While I noticed some very minor outdated Syntax for C# in this video such as the ArrayList.Add(0,1); instead of ArrayList.Insert(0,1); (This is if the orange box stands for C# syntax as how the video portrays the C# syntax to be color coded )This free course is not only extremely relevant , but also one of the easiest courses to understand.

[@RedEyedJedi]

23:33 "We can't store different types of variables in the same array" JavaScript "Am I dead to you?"

[@mikediaz9033]

First of all I would like to say, Thankyou. I realize I am poor and 2nd...arilly if your Pitch/Presentation can assist your followers & increase, your power, and Money's for use in gains for your Brand's ultimate goal. I understand this Concept, just don't leave the poor please, for you'll be surprised, with respect to, Real "Creativity", AMEN 🙏. To You & All Spiritual Entities & Everyones belief. I 'm just saying, again Thankyou So Much ☺.

[@lifeoftravel535]

Really Nice and Really Beautiful "Data Structures " . Stay Connected!😍😍😍🤗🤗🤗

[@kesavae9552]

Honestly that thumbnail of yours got me here...✌️

[@JJCUBER]

47:19 this is not true, you can populate an ArrayList with elements when initializing it by doing something like "ArrayList test = new ArrayList() { 1, 5, 4, 2 };" (while this technically compiles down to a .Add() for each element, you are still effectively initializing it in a similar fashion to normal arrays)

[@NullPointerException]

Good catch, did not know about this, sorry for the confusion.

[@juliaheinzelmann7756]

This was amazing. Can't believe you are 18!

[@rodrigoaragao5657]

In many other online sources, I have seen that Open Hash Tables are the ones that use Linked Lists for Collisions and Closed Hash Tables use Linear Probing (which is the opposite as what is shown in this video)

[@wampwamp1458]

the time complexeity equations at 14:54 are ordered wrong; O(n) > O(log n)

[@manolisgkoulias8290]

One of the best videos I 've ever seen! Thanks a lot man!

[@Dhruv-qw7jf]

2-Dimensional Arrays: 32:42

[@camilamarques4394]

Thanks a lot for sharing all this knowledge!! So far the best educational videos for the new comers!

[@Supakills101]

Thanks this is a great refresher even for more advanced students. Love this channel

[@amitkokane1448]

Hey! Can you make a introduction video on Algorithms it would be great.

[@flair4030]

Check out his and Geek's Lesson on the same

[@DevGamer19]

Great tutorial! Note: 14:53 O(log n) is better than O(n). Big thanks for your great video 😍

[@michaelmaranan2724]

1:10:06 Its not random words, This Video has hidden message

[@amicusaxiom]

well you hit your 1000 subs goal