Cover coming soon

Data Structures and Algorithms in JavaScript

by Federico Kereki
December 2024, 495 pp.
Use coupon code PREORDER to get 25% off!

For Javascript developers, this book is a one-stop shop for learning the algorithms and data structures that solve and optimize complex problems. Covering everything from functional programming and abstract data types, to sorting and searching, lists, bags, binary trees, forests, heaps, and graphs—the author uses examples taken from coding challenges and interview questions, enabling readers to explore the real-world advantages of specific algorithms and data structures. 

Written and illustrated to be a developer’s go-to reference manual as well as for immediate on-the-job applications, performance—both from a theoretical point of view and a practical standpoint—is considered alongside every algorithm or data structure introduced. In addition to demonstrating best practices throughout the text, each chapter ends with a series of questions that amplify the preceding concepts and provide further examples for the reader to apply. Also of note, the book utilizes the latest version of JavaScript (ECMAScript) and its more modern features wherever appropriate.

Author Bio 

Federico Kereki is a Computer Systems Engineer with an M.Sc. in Education. He has over 30 years’ experience as consultant, system developer, university professor, and writer. Currently, he is a subject matter expert at Globant, where he gets to use a mixture of development frameworks, programming tools, and operating systems, such as JavaScript; Node.js; React, Vue, Svelte, Angular, Docker and containers, and SOA. Has given talks on several programming topics, such as functional programming, agile methodologies, and data structures. He has taught several courses at the Universidad de la República, Universidad ORT, and Universidad de la Empresa, and he lives in Montevideo, Uruguay.

Table of contents 

Chapter 1:The JavaScript Language and Development tools
Chapter 2: Functional Programming in JavaScript
Chapter 3: Abstract Data Types
Chapter 4:Analyzing Algorithms

Chapter 5: Designing Algorithms
Chapter 6: Sorting
Chapter 7: Selecting
Chapter 8: Shuffling and Sampling
Chapter 9: Searching

Chapter 10: Lists
Chapter 11: Bags, sets, and maps
Chapter 12: Binary Trees
Chapter 13: Trees and Forests
Chapter 14: Heaps
Chapter 15: Extended Heaps
Chapter 16: Digital Search Trees
Chapter 17: Graphs
Chapter 18: Immutability and Functional Data Structures
Answer Key


The chapters in red are included in this Early Access PDF.