📎 Webclip
dsa.js: Data Structures and Algorithms in JavaScript
The repository collects the coding implementations of the DSA.js book and the NPM package. It presents data structures and algorithms in JavaScript as reference material for developers, with book and repo formats.
Reading notes#
- It includes explanations and code for algorithms and data structures in JavaScript.
- It is meant as a reference manual and as a way to review topics before interviews.
- It covers algorithm runtime and Big O comparisons, including examples for duplicate finding and common time complexities.
- It covers linear data structures such as arrays, linked lists, queues, and stacks, and explains when to use arrays or linked lists.
- It includes implementations of linked lists, stacks, and queues from scratch.
- It covers hash maps, tree maps, graphs, and trees, including binary trees, binary search trees, AVL trees, and red-black trees.
- It explains BST operations such as adding, removing, and updating values, and shows balancing from an unbalanced BST to a balanced one.
- It presents an algorithmic toolbox with steps for solving problems, sorting algorithms, and techniques such as greedy algorithms, dynamic programming, divide and conquer, backtracking, and brute force.
- The project is also available as a book with 180+ pages, plus ePub and Mobi versions.
