JavaScript Algorithms and Data Structures

🇺🇦 UKRAINE IS BEING ATTACKED BY RUSSIAN ARMY. CIVILIANS ARE GETTING KILLED. RESIDENTIAL AREAS ARE GETTING BOMBED. - Help Ukraine via: - Serhiy Prytula Charity Foundation - Come Back Alive Charity Foundation - National Bank of Ukraine - More info on war.ukraine.ua and MFA of Ukraine

This repository contains JavaScript based examples of many popular algorithms and data structures.

Each algorithm and data structure has its own separate README with related explanations and links for further reading (including ones to YouTube videos).

Read this in other languages: 简体中文, 繁體中文, 한국어, 日本語, Polski, Français, Español, Português, Русский, Türkçe, Italiano, Bahasa Indonesia, Українська, Arabic, Tiếng Việt, Deutsch, Uzbek, עברית

Data Structures

A data structure is a particular way of organizing and storing data in a computer so that it can be accessed and modified efficiently. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.

Remember that each data has its own trade-offs. And you need to pay attention more to why you're choosing a certain data structure than to how to implement it.

B - Beginner, A - Advanced

• B Linked List
• B Doubly Linked List
• B Queue
• B Stack
• B Deque - double-ended queue
• B Hash Table
• B Heap - max and min heap versions
• B Priority Queue
• A Trie
• A Tree
• A Binary Search Tree
• A AVL Tree
• A Red-Black Tree
• A Segment Tree - with min/max/sum range queries examples
• A Fenwick Tree (Binary Indexed Tree)
• A Graph (both directed and undirected)
• A Disjoint Set - a union–find data structure or merge–find set
• A Bloom Filter
• A LRU Cache - Least Recently Used (LRU) cache

Algorithms

An algorithm is an unambiguous specification of how to solve a class of problems. It is a set of rules that precisely define a sequence of operations.

B - Beginner, A - Advanced

Algorithms by Topic

• Math
• B Bit Manipulation - set/get/update/clear bits, multiplication/division by two, make negative etc.
• B Binary Floating Point - binary representation of the floating-point numbers.
• B Factorial
• B Fibonacci Number - classic and closed-form versions
• B Prime Factors - finding prime factors and counting them using Hardy-Ramanujan's theorem
• B Primality Test (trial division method)
• B Euclidean Algorithm - calculate the Greatest Common Divisor (GCD)
• B Least Common Multiple (LCM)
• B Sieve of Eratosthenes - finding all prime numbers up to any given limit
• B Is Power of Two - check if the number is power of two (naive and bitwise algorithms)
• B Pascal's Triangle
• B Complex Number - complex numbers and basic operations with them
• B Radian & Degree - radians to degree and backwards conversion
• B Fast Powering
• B Horner's method - polynomial evaluation
• B Matrices - matrices and basic matrix operations (multiplication, transposition, etc.)
• B Euclidean Distance - distance between two points/vectors/matrices
• A Integer Partition
• A Square Root - Newton's method
• A Liu Hui π Algorithm - approximate π calculations based on N-gons
• A Discrete Fourier Transform - decompose a function of time (a signal) into the frequencies that make it up
• Sets
• B Cartesian Product - product of multiple sets
• B Fisher–Yates Shuffle - random permutation of a finite sequence
• A Power Set - all subsets of a set (bitwise, backtracking, and cascading solutions)
• A Permutations (with and without repetitions)
• A Combinations (with and without repetitions)
• A Longest Common Subsequence (LCS)
• A Longest Increasing Subsequence
• A Shortest Common Supersequence (SCS)
• A Knapsack Problem - "0/1" and "Unbound" ones
• A [Maximum Subarray](https://github.com/t