Sign In Start Free Trial

Book Overview & Buying
Table Of Contents

Learning JavaScript Data Structures and Algorithms - Fourth Edition

By : Loiane Groner, Aris Markogiannakis, Daniel Ostrovsky

Learning JavaScript Data Structures and Algorithms

By: Loiane Groner, Aris Markogiannakis, Daniel Ostrovsky

Overview of this book

Data structures and algorithms are foundational topics for software developers. This easy-to-follow book from experienced developer and trainer Loiane Groner will help you to fill in the gaps in your knowledge – whether you’re a self-taught developer, you’re preparing for technical interviews, or you just want to write better code and improve your problem-solving skills. This fourth edition covers essential data structures, algorithms, and their usage in the context of JavaScript. You’ll follow examples in both JavaScript and TypeScript, in line with the latest standards and best practices, learning how to do complexity analysis along the way. New to this edition are LeetCode and HackerRank exercises at the end of each chapter, which you'll be guided through solving. You’ll also find brand-new chapters on the tries data structure, and string and math algorithms. By the end of the book, you will know how to develop programs using the best data structures and algorithms for the job.

Free Chapter

Learning JavaScript Data Structures and Algorithms, Fourth Edition: Enhance your problem-solving skills in JavaScript and TypeScript

Learning JavaScript Data Structures and Algorithms, Fourth Edition: Enhance your problem-solving skills in JavaScript and TypeScript

1 Introducing Data Structures and Algorithms in JavaScript

1 Introducing Data Structures and Algorithms in JavaScript

The importance of data structures

Why algorithms matter

Why companies ask for these concepts during interviews

Why choose JavaScript to learn data structures and algorithms?

Setting up the environment

JavaScript Fundamentals

TypeScript fundamentals

Summary

2 Big O notation

2 Big O notation

Understanding Big O notation

Big O time complexities

Space complexity

Calculating the complexity of an algorithm

Big O notation and tech interviews

Exercises

Summary

3 Arrays

3 Arrays

Why should we use arrays?

Creating and initializing arrays

Accessing elements and iterating an array

Adding elements

Removing elements

Adding and removing elements from a specific position

Iterator methods

Searching an array

Sorting elements

Transforming an array

References for other JavaScript array methods

Two-dimensional arrays

Multi-dimensional arrays

The TypedArray class

Arrays in TypeScript

Creating a simple TODO list using arrays

Exercises

Summary

4 Stacks

4 Stacks

The stack data structure

Creating an array-based Stack class

Creating a JavaScript object-based Stack class

Creating the Stack class using TypeScript

Solving problems using stacks

Exercises

Summary

5 Queues and Deques

5 Queues and Deques

The queue data structure

Creating the Queue class

The deque data structure

Creating the Deque class

Creating the Queue and Deque classes in TypeScript

Solving problems using queues and deques

Exercises

Summary

6 Linked Lists

6 Linked Lists

The linked list data structure

Creating the LinkedList class

Doubly linked lists

Circular linked lists

Creating a media player using a linked list

Reviewing the efficiency of the linked lists

Exercises

Summary

7 Sets

7 Sets

The set data structure

Creating the MySet class

Performing mathematical operations with a set

The JavaScript Set class

Reviewing the efficiency of sets

Exercises

Summary

8 Dictionaries and Hashes

8 Dictionaries and Hashes

The dictionary data structure

Creating the Dictionary class

The JavaScript Map class

The hash table data structure

Creating the HashTable class

The hash set data structure

Maps and TypeScript

Reviewing the efficiency of maps and hash maps

Exercises

Summary

Creating the Deque class

As usual, we will start by declaring the Deque class located in the file src/05-queue-deque/deque.js:

class Deque {
  #items = [];
}

We will continue using an array-based implementation for our data structure. And given the deque data structure allows inserting and removing from both ends, we will have the following methods:

addFront(item): This method adds a new element at the front of the deque.
addRear(item): This method adds a new element at the back of the deque.
removeFront(): This method removes the first element from the deque.
removeRear(): This method removes the last element from the deque.
peekFront(): This method returns the first element from the deque.
peekRear(): This method returns the last element from the deque.

The Deque class also implements the isEmpty, clear, size, and toString methods (you can check the complete source code by downloading the source code bundle for this book). The code for these is the same as for the Queue class.
...

Search

Your notes and bookmarks