About this project

This repository is a collection of JavaScript-based examples of algorithms and data structures. Each entry has a dedicated README with explanations and external references, including YouTube videos. It is intended primarily for learning and interview preparation rather than as a production library. Data structures covered include linked lists, queues, stacks, hash tables, heaps, priority queues, trees (binary search, AVL, red-black, segment, and Fenwick trees), graphs, disjoint sets, Bloom filters, and LRU caches. Algorithms are listed both by topic (math, sets, strings, searches, sorting, trees, graphs, cryptography, machine learning, image processing, statistics, and evolutionary algorithms) and by paradigm (brute force, greedy, divide and conquer, dynamic programming, backtracking, and branch & bound). Items are marked B for Beginner and A for Advanced. The project includes a playground file for experimentation and tests for all implementations. Common commands are npm install, npm run lint, npm test, and npm test -- 'LinkedList'. Node.js >=16 is recommended. The README also contains complexity tables for Big O notation, data structure operations, and array sorting algorithms.