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 stepbystep 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.
Table of contents
 Chapter 1 : Introduction

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
 Chapter 4 : The Big O Time Space Asymptomatic Analysis
 Chapter 5 : Linked Lists

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
 Chapter 8 : Recursion

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
 Chapter 11 : Graphs
Product information
 Title: Data Structures in JavaScript  Master the Fundamentals
 Author(s):
 Release date: October 2020
 Publisher(s): Packt Publishing
 ISBN: 9781800566576
You might also like
book
HandsOn Data Structures and Algorithms with JavaScript
Increase your productivity by implementing complex data structures and algorithms using JavaScript About This Book A …
book
Data Structures and Algorithms with JavaScript
As an experienced JavaScript developer moving to serverside programming, you need to implement classic data structures …
video
Mastering Clean Code in JavaScript
Alongside HTML and CSS, JavaScript is one of the three core technologies of World Wide Web …
video
Learning Algorithms in JavaScript from Scratch
Using algorithms in your programming allows you to improve the efficiency, performance, speed, and scalability of …