Data Structures in JavaScript - Master the Fundamentals

Video description

Understand the complex world of data structures and algorithms with ease by solving interesting problems

About This Video

Get to grips with the fundamentals of data structures and algorithms
Learn how to solve common computer programs using algorithms
Solve challenges such as Minesweeper, Sieve of Eratosthenes, and Morse code

In Detail

Data structures allow you to organize code in the most efficient way to help you perform …

Data Structures in JavaScript - Master the Fundamentals

Video description

Understand the complex world of data structures and algorithms with ease by solving interesting problems

About This Video

Get to grips with the fundamentals of data structures and algorithms
Learn how to solve common computer programs using algorithms
Solve challenges such as Minesweeper, Sieve of Eratosthenes, and Morse code

In Detail

Data structures allow you to organize code in the most efficient way to help you perform operations effectively. An algorithm is a step-by-step procedure for solving problems, be it solving a computer problem, writing source code, or innovating new programs. With this course, you’ll learn the concepts of data structures and algorithms using JavaScript.

Starting with an introduction to data structures and algorithms, the course takes you through the concept of arrays, where you’ll solve a minesweeper challenge to understand the importance of an array in data structures. Next, you’ll become familiar with lists and discover how Big O helps in describing the complexity of an algorithm. As you advance, you’ll gain insights into stacks, queues, recursion, and trees by solving challenges such as condense, Josephus, palindrome, and Morse code. Toward the end, you’ll get an overview of hash maps and graphs.

By the end of this course, you’ll have developed a solid understanding of data structures and algorithms essential for building reliable software.

Who this book is for

If you are looking to build a solid foundation in data structures and algorithms to design and develop software, then this is the course for you.

Publisher resources

Download Example Code

Chapter 1 : Introduction

Course Outline

Chapter 2 : Arrays

Arrays vs Lists

Common Array Iterations

Pairwise Array Comparisons

Array Functions

Searching Arrays

“Is Sorted” Challenge

“Is Sorted” Solution

Two Dimensional (2D) Arrays

Iterating Over Two Dimensional Arrays

Two Dimensional Bounds Checking

The Minesweeper Challenge

The Minesweeper Solution

The Tally Sort Challenge

The Tally Sort Solution

Chapter 3 : Lists

Lists Out of Arrays

Implementing List Push and Grow Functions

Implementing List Remove

Implement List Insert

The List Contains Challenge

The List Contains Solution

List Get and Set

The Concat Challenge

The Concat Solution

Chapter 4 : The Big O Time Space Asymptomatic Analysis

Introduction to Big O

Big O of N-Squared

Timing Big O of One Versus N Versus N-Squared

No Constants- N Big O Notation

The Big O Challenge

The Big O Solution

Chapter 5 : Linked Lists

Linked Lists

Coding Linked Lists

Linked List Manipulation Challenge

Linked List Manipulation Solution

Linked List Class

Get at Index

Remove at Index

Add at Index

Summarizing Arrays vs Linked Lists

Prefer Manipulating Pointers to Copying Data

Chapter 6 : Stacks

Introduction to Stacks

Stack Implementations

Stack Out of Linked List

Stack Out of Array

The Balance Parenthesis Challenge

The Balance Parenthesis Solution

The Paren Bracket Curly Balance Challenge

The Paren Bracket Curly Balance Solution

The Condense Challenge

The Condense Inefficient Solution

The Condense Efficient Solution

Chapter 7 : Queues

Introduction to Queues

Implementing a Queue

The Josephus Challenge

The Josephus Solution

The Sieve of Eratosthenes Challenge

The Sieve of Eratosthenes Solution

Native JavaScript (JS) Arrays Stacks and Queues

Chapter 8 : Recursion

Introduction to Recursion

Recursive Fibonacci

The Palindrome Challenge

Palindrome Hints

The Palindrome Solution

Palindrome Bonus

Chapter 9 : Trees

Introduction to Trees

Iterating Over Trees

The Tree Sum Challenge

The Tree Sum Solution

The Tree Contains Challenge

The Tree Contains Solution

The Tree Size Leaves Challenge

The Tree Size Leaves Solution

The Tree Min Max Height Challenge

The Tree Min Max Height Solution

Binary Search Trees

Binary Search Tree Add

The Binary Search Tree Contains Challenge

The Binary Search Tree Contains Solution

Unbalanced Binary Search Trees

The Morse Code Challenge

The Morse Code Solution

Chapter 10 : Hash maps

Introduction to Hash Maps

Handling Collisions with Linear Probing

Handling Collisions by Chaining Linked Lists

Coding Linked List Collisions

Chapter 11 : Graphs

Introduction to Graphs

Coding a Graph Class

Breadth First and Depth First Traversals

Start your Free Trial

Self paced

Go to the Course
We have partnered with providers to bring you collection of courses, When you buy through links on our site, we may earn an affiliate commission from provider.