Steven from NullPointer Exception teaches the fundamentals of data structures, including Big O notation and twelve common data structures.
Learn all about Data Structures in this lecture-style course. You will learn what Data Structures are, how we measure a Data Structures efficiency, and then hop into talking about 12 of the most common Data Structures which will come up throughout your Computer Science journey.
✏️ Course created by Steven from NullPointer Exception. Check out their channel: youtube.com/channel/UCmWDlvMYYEbW42B8JyxFBcA
⭐️ Script, Visuals, and Sources ⭐️
🔗 Google Folder: tinyurl.com/yxr64y46
⭐️ Links as They Appear ⭐️
🔗 An Introduction to Programming: youtube.com/watch?v=zOjov-2OZ0E
🔗 Binary Search Explanation: youtu.be/zOjov-2OZ0E?t=5566
🔗 Linear Search Explanation: youtu.be/zOjov-2OZ0E?t=5457
🔗 Introduction to Object Oriented Programming: youtube.com/watch?v=3ycztbPPOlc
🔗 Recursion Explanation: youtu.be/zOjov-2OZ0E?t=5787
🔗 Article explaining Backed Data Structures: tinyurl.com/y3fs9lt7
❤️ Try interactive Algorithms courses we love, right in your browser: scrimba.com/freeCodeCamp-Algorithms (Made possible by a grant from our friends at Scrimba)
⭐️ Course Contents ⭐️
💻 () Introduction
⌨️ () Timestamps
⌨️ () Script and Visuals
⌨️ () References + Research
⌨️ () Questions
⌨️ () Shameless Plug
⌨️ () What are Data Structures?
⌨️ () Series Overview
💻 () Measuring Efficiency with BigO Notation
⌨️ () Time Complexity Equations
⌨️ () The Meaning of BigO
⌨️ () Why BigO?
⌨️ () Quick Recap
⌨️ () Types of Time Complexity Equations
⌨️ () Final Note on Time Complexity Equations
💻 () The Array
⌨️ () Array Basics
⌨️ () Array Names
⌨️ () Parallel Arrays
⌨️ () Array Types
⌨️ () Array Size
⌨️ () Creating Arrays
⌨️ () Populate-First Arrays
⌨️ () Populate-Later Arrays
⌨️ () Numerical Indexes
⌨️ () Replacing information in an Array
⌨️ () 2-Dimensional Arrays
⌨️ () Arrays as a Data Structure
⌨️ () Pros and Cons
💻 () The ArrayList
⌨️ () Structure of the ArrayList
⌨️ () Initializing an ArrayList
⌨️ () ArrayList Functionality
⌨️ () ArrayList Methods
⌨️ () Add Method
⌨️ () Remove Method
⌨️ () Get Method
⌨️ () Set Method
⌨️ () Clear Method
⌨️ () toArray Method
⌨️ () ArrayList as a Data Structure
⌨️ () Comparing and Contrasting with Arrays
💻 () The Stack
⌨️ () The Different types of Data Structures
⌨️ () Random Access Data Structures
⌨️ () Sequential Access Data Structures
⌨️ () Stack Basics
⌨️ () Common Stack Methods
⌨️ () Push Method
⌨️ () Pop Method
⌨️ () Peek Method
⌨️ () Contains Method
⌨️ () Time Complexity Equations
⌨️ () Uses for Stacks
💻 () The Queue
⌨️ () Queue Basics
⌨️ () Common Queue Methods
⌨️ () Enqueue Method
⌨️ () Dequeue Method
⌨️ () Peek Meth
Why it's here
1 person recommends this
What people say. Recommended as a comprehensive free course on YouTube covering most fundamental data structures.
A
u/ASteelyDanin r/ExperiencedDevs • Recommends
On “Should I need to concentrate on fundamentals”
For an overview I used MIT OpenCourseWare's 6.006 Introduction to Algorithms. I also read (some of) Skiena's Algorithm Design Manual which had more depth than the courses but wasn't as good as explaining concepts in detail.
For Data Structures there are a number of free courses available on Youtube. This one seems to cover most of it. These videos from HackerRank by the author of Cracking the Coding Interview on Data Structures and Algorithms were also quality.
If you've been programming a while you probably know the basics like array/list, map/dict, and set. Make sure you know how those are implemented as well as the less frequently used data structures such as stack, queue, heap, t…
