Mastering Data Strucures for MAANG!

Who am I ?

Hello everyone and welcome to An Introduction to Data Structures course. Before we dive in my name is Vicky, I am HIGH SCHOOL DROPOUT that has a passion for programming and everything in tech! Teaching and writing guides is my favorite past-time and allows for me to reinforce my learning while providing value to all of my supporters.

Is this book for you?

This book is for anyone who is familiar with basic programming language and wants to take their problem solving and software development skills to the next level.

What you'll learn in this?

We’ll be tackling the topic of data structures in relation to computer Science. More specifically, we’ll be talking about what they are, going over some different types of data structures, and discussing how we can use each of them effectively with examples. This course will be a general overview of data structures and so we won’t be confining ourselves to one specific language; however, this series will require you to have a basic understanding of programming.

Additionally, for each segment, I’ll be including the references and research materials.

So the obvious question to start with is what exactly is a data structure? Well in Computer Science, a data structure is a way to store, organize, and manage information -or data- in a way that allows you the programmer to easily access or modify the values within them. Essentially, it’s a way for us to store a set of related information that we can then use for our programs. Data Structures, and the algorithms used to interact, modify, and search through them provide the backbone for many of the programs you’ll end up writing. I can almost guarantee that in 99% of your programs, a data structure will be involved. Each of the data structures we’ll be talking about are designed for the sole purpose of storing information and allowing the end user to access and manipulate that information in an efficient and effective way, but each one differs in the manner that they accomplish this.

Course Contents

• Introduction
• References + Research
• Questions
• What are Data Structures?
• Series Overview
• Measuring Efficiency with BigO Notation
• Time Complexity Equations
• The Meaning of BigO
• Why BigO?
• 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 Method
• Contains Method
• Time Complexity Equations
• Common Queue Uses
• The Linked List
• LinkedList Visualization
• Adding and Removing Information
• Time Complexity Equations
• Uses for LinkedLists
• The Doubly-LinkedList
• Visualization
• Adding and Removing Information
• Time Complexity Equations
• Uses of a Doubly-LinkedList
• The Dictionary
• Dictionary Basics
• Indexing Dictionaries
• Dictionary Properties
• Hash Table Mini-Lesson
• Time Complexity Equations
• Trees
• Introduction to Hierarchical Data
• Formal Background on the Tree
• Tree Terminology and Visualization
• Different types of Trees
• Uses for the Tree
• Tries
• Trie Basics
• Trie Visualization
• Flagging
• Uses for Tries
• Heaps
• Heap Basics
• Min-Heaps
• Max-Heaps
• Building Heaps
• Deleting from Heaps
• Heap Implementations
• Graphs
• Graph Basics
• Directed vs. Undirected Graphs
• Cyclic vs. Acyclic Graphs
• Weighted Graphs
• Types of Graphs
• Conclusion

• Example: Adding and removing information in Linked List
  

Tries:

Refund policy

If you're not 100% satisfied with the purchase, or it's not what you were expecting, just reply to the download email within 30 days, and you'll get a full refund. No questions asked.

• Good Luck & Happy Coding