Chapter 1, JavaScript - A Quick Overview, covers the basics of JavaScript needed prior to learning data structures and algorithms. It also covers the setup of the development environment needed for this book.
Chapter 2, ECMAScript and TypeScript Overview, covers some new JavaScript functionalities introduced since 2015 and also covers the basic functionalities of TypeScript, a JavaScript superset.
Chapter 3, Arrays, explains how to use the most basic and most used data structure, which are the arrays. This chapter demonstrates how to declare, initialize, add, and remove elements from an array. It also covers how to use native JavaScript Array methods.
Chapter 4, Stacks, introduces the stack data structure, demonstrating how to create a stack and add and remove elements. It also demonstrates how to use stack to solve some computer science-related problems.
Chapter 5, Queues and Deques, covers the queue data structure, demonstrating how to create a queue and add and remove its elements. It covers the deque data structure, a special type of the queue. It also demonstrates how to use queue to solve some computer science-related problems and the major differences between queues and stacks.
Chapter 6, Linked Lists, explains how to create the linked list data structure from scratch using objects and "pointer" concept. Besides covering how to declare, create, add, and remove elements, it also covers the various types of linked lists, such as the doubly linked list and circular linked list.
Chapter 7, Sets, introduces the set data structure and how it can be used to store non-repeated elements. It also explains the different types of set operations and how to implement and use them.
Chapter 8, Dictionaries and Hashes, explains the dictionary and hash data structures and the differences between them. This chapter covers how to declare, create, and use both data structures. It also explains how to handle collisions in hash and techniques for creating better hash functions.
Chapter 9, Recursion, introduces the concept of recursion and demonstrates the differences between declarative and recursive algorithms.
Chapter 10, Trees, covers the tree data structure, its terminology, focusing on Binary Search Tree data— its methods to search, traverse, add, and remove nodes. It also introduces self-balancing trees, such as the AVL and Red-Black trees.
Chapter 11, Binary Heap and Heap Sort, covers the min heap and max heap data structures, how to use the heap as a priority queue, and discusses the famous heap sort algorithm.
Chapter 12, Graphs, introduces the amazing world of graphs and its application in real-world problems. This chapter covers the most common graph terminology, the different way of representing a graph, how to traverse graphs using the Breadth-First Search and Depth-First Search algorithms and its applications.
Chapter 13, Sorting and Searching Algorithms, explores the most used sorting algorithms, such as the Bubble sort (and its improved version), Selection sort, Insertion sort, Merge sort, and Quick sort. It also covers the counting and radix sort, two distributed sorting algorithms. It also covers how to search algorithms, such as the sequential and binary search, and how to shuffle arrays.
Chapter 14, Algorithm Designs and Techniques, introduces some algorithm techniques and some of the most famous algorithms. It also covers an introduction to functional programming in JavaScript.
Chapter 15, Algorithm Complexity, introduces the Big-O notation and its concepts along with a cheat sheet of the complexity of the algorithms implemented in this book. It covers an introduction to NP-Completeness problems and heuristic solutions. At last, it explains how to take your algorithm knowledge to the next level.
