A collection of JavaScript code examples for classic algorithms and data structures, aimed at developers who want to see how these ideas work in a language they already use. Each topic is labeled beginner or advanced, so readers can choose where to start.
The data structures section covers lists, stacks, queues, hash tables, heaps, trees, graphs, tries and caches. The algorithms section is grouped by topic, from math and sorting to graphs and cryptography, and by design approach, such as greedy, divide and conquer and dynamic programming. Each entry has its own README with an explanation and links for further reading, some of them to videos.
Categories
Similar apps
A free guide to large-scale system design and interview prep, with flashcards
Python implementations of classic algorithms, built for learning rather than production
Free, condensed interview prep for busy engineers, from resume to offer