book

Learning JavaScript Data Structures and Algorithms - Fourth Edition

Name: Learning JavaScript Data Structures and Algorithms - Fourth Edition
Author: Loiane Groner
ISBN: 9781836205395

by Loiane Groner

October 2026

Intermediate to advanced

615 pages

5h 51m

English

Packt Publishing

Read now

Unlock full access

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
The importance of data structuresWhy algorithms matterWhy companies ask for these concepts during interviewsWhy choose JavaScript to learn data structures and algorithms?Setting up the environmentInstalling a code editor or IDEJavaScript FundamentalsHello WorldVariables and data typesControl structuresFunctionsObject-oriented programming in JavaScriptModern TechniquesTypeScript fundamentalsType inferenceInterfacesGenericsEnumsType aliasesTypeScript compile-time checking in JavaScript filesOther TypeScript functionalitiesSummary
2 Big O notation
Understanding Big O notationBig O time complexitiesO(1): constant timeO(log(n)): logarithmic timeO(n): linear timeO(nˆ2): quadratic timeO(2^n): exponential time complexityO(n!): factorial timeComparing complexitiesSpace complexityCalculating the complexity of an algorithmBig O notation and tech interviewsExercisesSummary
3 Arrays
Why should we use arrays?Creating and initializing arraysAccessing elements and iterating an arrayUsing the for..in loopUsing the for…of loopAdding elementsInserting an element at the end of the arrayInserting an element in the first positionRemoving elementsRemoving an element from the end of the arrayRemoving an element from the first positionAdding and removing elements from a specific positionIterator methodsIterating using the forEach methodIterating using the every methodIterating using the some methodSearching an arraySearching with indexOf, lastIndexOf and includes methodsSearching with find, findIndex and findLastIndex methodsFiltering elementsSorting elementsCustom sortingSorting StringsTransforming an arrayMapping values of an arraySplitting into an array and joining into a stringUsing the reduce method for calculationsReferences for other JavaScript array methodsUsing the isArray methodUsing the from methodUsing the Array.of methodUsing the fill methodJoining multiple arraysTwo-dimensional arraysIterating the elements of two-dimensional arraysMulti-dimensional arraysThe TypedArray classArrays in TypeScriptCreating a simple TODO list using arraysExercisesReversing an arrayArray left rotationSummary
4 Stacks
The stack data structureCreating an array-based Stack classPushing elements to the top of the stackPopping elements from the stackPeeking the element from the top of the stackVerifying whether the stack is empty and its sizeClearing the elements of the stackExporting the Stack data structure as a library classUsing the Stack classReviewing the efficiency of our Stack classCreating a JavaScript object-based Stack classPushing elements to the stackVerifying whether the stack is empty and its sizePopping elements from the stackPeeking the top of the stack and clearing itCreating the toString methodComparing object-based approach with array-based stackCreating the Stack class using TypeScriptSolving problems using stacksConverting decimal numbers to binaryThe base converter algorithmExercisesValid ParenthesesMin StackSummary
5 Queues and Deques
The queue data structureCreating the Queue classEnqueueing elements to end of the queueDequeuing elements from beginning of the queuePeeking the element from the front of the queueVerifying if it is empty, the size and clearing the queueExporting the Queue data structure as a library classUsing the Queue classReviewing the efficiency of our Queue classThe deque data structureCreating the Deque classAdding elements to the dequeRemoving elements from the dequePeeking elements of the dequeUsing the Deque classCreating the Queue and Deque classes in TypeScriptSolving problems using queues and dequesThe circular queue: the Hot Potato gamePalindrome checkerExercisesNumber of Students Unable to Eat LunchSummary
6 Linked Lists
The linked list data structureCreating the LinkedList classAppending elements to the end of the linked listPrepending a new element to the linked listInserting a new element at a specific positionReturning the position of an elementRemoving an element from a specific positionSearching and removing an element from the linked listChecking if it is empty, clearing and getting the current sizeTransforming the linked list into a stringDoubly linked listsAppending a new elementPrepending a new element to the doubly linked listInserting a new element at any positionRemoving an element from a specific positionCircular linked listsAppending a new elementPrepending a new elementRemoving an element from a specific positionCreating a media player using a linked listAdding new songs by title order (sorted insertion)Playing a songPlaying the next or previous songUsing our media playerReviewing the efficiency of the linked listsExercisesReverse Linked ListSummary
7 Sets
The set data structureCreating the MySet classFinding a value in the setAdding values to the setRemoving and clearing all valuesRetrieving the size and checking if it is emptyRetrieving all the valuesUsing the MySet classPerforming mathematical operations with a setUnion: combining two setsIntersection: identifying common values in two setsDifference between two setsSubset: checking if a set contains all the valuesThe JavaScript Set classReviewing the efficiency of setsExercisesRemove duplicates from sorted arraySummary
8 Dictionaries and Hashes
The dictionary data structureCreating the Dictionary classVerifying whether a key exists in the dictionarySetting a key and value in the dictionaryRemoving and clearing all values from the dictionaryRetrieving the size and checking if it is emptyRetrieving a value from the dictionaryRetrieving all the values and all the keys from the dictionaryIterating each value-pair of the dictionary with forEachUsing the Dictionary classThe JavaScript Map classThe JavaScript WeakMap and WeakSet classesThe hash table data structureCreating the HashTable classCreating the lose-lose hash functionPutting a key and a value in the hash tableRetrieving a value from the hash tableRemoving a value from the hash tableUsing the HashTable classCollisions between keys in a hash tableHandling collisions with separate chaining techniqueHandling collisions with the linear probing techniqueCreating better hash functionsThe hash set data structureMaps and TypeScriptReviewing the efficiency of maps and hash mapsExercisesInteger to RomanSummary

Content preview from Learning JavaScript Data Structures and Algorithms - Fourth Edition

2 Big O notation

Before you begin: Join our book community on Discord

Give your feedback straight to the author himself and chat to other early readers on our Discord server (find the "learning-javascript-dsa-4e" channel under EARLY ACCESS SUBSCRIPTION).

https://packt.link/EarlyAccess/

In this chapter, we will unlock the power of Big O notation, a fundamental tool for analyzing the efficiency of algorithms in terms of both time complexity (how runtime scales with input size) and space complexity (how memory usage scales). We will explore common time complexities like O(1), O(log n), O(n), and others, along with their real-world implications ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Data Structures and Algorithms in JavaScript

Publisher Resources

ISBN: 9781836205395

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Learning JavaScript Data Structures and Algorithms - Fourth Edition

by Loiane Groner

2 Big O notation

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.