https://github.com/trekhleb/javascript-algorithms Skip to content Toggle navigation Sign up * Product + Actions Automate any workflow + Packages Host and manage packages + Security Find and fix vulnerabilities + Codespaces Instant dev environments + Copilot Write better code with AI + Code review Manage code changes + Issues Plan and track work + Discussions Collaborate outside of code + Explore + All features + Documentation + GitHub Skills + Blog * Solutions + For + Enterprise + Teams + Startups + Education + By Solution + CI/CD & Automation + DevOps + DevSecOps + Case Studies + Customer Stories + Resources * Open Source + GitHub Sponsors Fund open source developers + The ReadME Project GitHub community articles + Repositories + Topics + Trending + Collections * Pricing [ ] * # In this repository All GitHub | Jump to | * No suggested jump to results * # In this repository All GitHub | Jump to | * # In this user All GitHub | Jump to | * # In this repository All GitHub | Jump to | Sign in Sign up {{ message }} trekhleb / javascript-algorithms Public * * Notifications * Fork 27.5k * Star 167k Algorithms and data structures implemented in JavaScript with explanations and links to further readings License MIT license 167k stars 27.5k forks Star Notifications * Code * Issues 108 * Pull requests 194 * Actions * Security * Insights More * Code * Issues * Pull requests * Actions * Security * Insights trekhleb/javascript-algorithms This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository. master Switch branches/tags [ ] Branches Tags Could not load branches Nothing to show {{ refName }} default View all branches Could not load tags Nothing to show {{ refName }} default View all tags Name already in use A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch? Cancel Create 1 branch 0 tags Code * Local * Codespaces * Clone HTTPS GitHub CLI [https://github.com/t] Use Git or checkout with SVN using the web URL. [gh repo clone trekhl] Work fast with our official CLI. Learn more. * Open with GitHub Desktop * Download ZIP Sign In Required Please sign in to use Codespaces. Launching GitHub Desktop If nothing happens, download GitHub Desktop and try again. Launching GitHub Desktop If nothing happens, download GitHub Desktop and try again. Launching Xcode If nothing happens, download Xcode and try again. Launching Visual Studio Code Your codespace will open once ready. There was a problem preparing your codespace, please try again. Latest commit @trekhleb trekhleb Update Bakers. ... bbbfd32 Mar 26, 2023 Update Bakers. bbbfd32 Git stats * 1,095 commits Files Permalink Failed to load latest commit information. Type Name Latest commit message Commit time .github Upgrade packages and Node versions. (#989) January 30, 2023 08:19 .husky Disabling tests in pre-commit to speed up the commits. April 21, 2021 18:09 assets Adjusting README. July 15, 2020 06:51 src feat: added Ukrainian translation for factorial (#1006) March 16, 2023 20:40 .babelrc Update Jest and Babel version. March 8, 2019 16:38 .editorconfig Some text fixes. January 27, 2022 21:05 .eslintrc Upgrade packages and Node versions. (#989) January 30, 2023 08:19 .gitignore chore: ignore .DS_Store in git (#65) June 13, 2018 06:27 .npmrc Add a Divide and Conquer version of the MaxSubArray problem. February 4, 2022 08:56 .nvmrc Upgrade packages and Node versions. (#989) January 30, 2023 08:19 BACKERS.md Update Bakers. March 25, 2023 17:02 CODE_OF_CONDUCT.md Create CODE_OF_CONDUCT.md April 27, 2018 16:50 CONTRIBUTING.md Add links to the list of locales to CONTRIBUTING.md. September 24, 2018 07:33 LICENSE Some text fixes. January 27, 2022 21:05 README.ar-AR.md Add Vietnamese translation (#667) January 27, 2022 20:52 README.de-DE.md Fix typo in READMEs. May 26, 2021 10:55 README.es-ES.md Add Vietnamese translation (#667) January 27, 2022 20:52 README.fr-FR.md Add Vietnamese translation (#667) January 27, 2022 20:52 README.id-ID.md Add Vietnamese translation (#667) January 27, 2022 20:52 README.it-IT.md Add Vietnamese translation (#667) January 27, 2022 20:52 README.ja-JP.md fix small modification in README.ja-JP.md (#651) January 27, 2022 20:56 README.ko-KR.md Fix: spacing word (#639) January 27, 2022 21:01 README.md Update Bakers. March 25, 2023 17:02 README.pl-PL.md Add Vietnamese translation (#667) January 27, 2022 20:52 README.pt-BR.md Brazilian Portuguese translation and typos fixes (#943) October 10, 2022 15:23 README.ru-RU.md fix error (#637) January 27, 2022 21:02 README.tr-TR.md Add Vietnamese translation (#667) January 27, 2022 20:52 README.uk-UA.md Add Vietnamese translation (#667) January 27, 2022 20:52 README.vi-VN.md Add Vietnamese translation (#667) January 27, 2022 20:52 README.zh-CN.md Add Vietnamese translation (#667) January 27, 2022 20:52 README.zh-TW.md Add Vietnamese translation (#667) January 27, 2022 20:52 jest.config.js Upgrade packages and Node versions. (#989) January 30, 2023 08:19 package-lock.json Upgrade packages and Node versions. (#989) January 30, 2023 08:19 package.json Upgrade packages and Node versions. (#989) January 30, 2023 08:19 View code [ ] JavaScript Algorithms and Data Structures Data Structures Algorithms Algorithms by Topic Algorithms by Paradigm How to use this repository Useful Information References Big O Notation Data Structure Operations Complexity Array Sorting Algorithms Complexity Project Backers Author README.md JavaScript Algorithms and Data Structures UKRAINE IS BEING ATTACKED BY RUSSIAN ARMY. CIVILIANS ARE GETTING KILLED. RESIDENTIAL AREAS ARE GETTING BOMBED. + Help Ukraine via National Bank of Ukraine + Help Ukraine via SaveLife fund + More info on war.ukraine.ua and MFA of Ukraine --------------------------------------------------------------------- CI codecov 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: Jian Ti Zhong Wen , Fan Ti Zhong Wen , hangugeo, Ri Ben Yu , Polski, Francais, Espanol, Portugues, Russkii, Turkce, Italiana, Bahasa Indonesia, Ukrayins'ka, Arabic, Tieng Viet, Deutsch Note that this project is meant to be used for learning and researching purposes only, and it is not meant to be used for production. 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. B - Beginner, A - Advanced * B Linked List * B Doubly Linked List * B Queue * B Stack * 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 p Algorithm - approximate p 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 - "Brute Force" and "Dynamic Programming" (Kadane's) versions + A Combination Sum - find all combinations that form specific sum * Strings + B Hamming Distance - number of positions at which the symbols are different + B Palindrome - check if the string is the same in reverse + A Levenshtein Distance - minimum edit distance between two sequences + A Knuth-Morris-Pratt Algorithm (KMP Algorithm) - substring search (pattern matching) + A Z Algorithm - substring search (pattern matching) + A Rabin Karp Algorithm - substring search + A Longest Common Substring + A Regular Expression Matching * Searches + B Linear Search + B Jump Search (or Block Search) - search in sorted array + B Binary Search - search in sorted array + B Interpolation Search - search in uniformly distributed sorted array * Sorting + B Bubble Sort + B Selection Sort + B Insertion Sort + B Heap Sort + B Merge Sort + B Quicksort - in-place and non-in-place implementations + B Shellsort + B Counting Sort + B Radix Sort + B Bucket Sort * Linked Lists + B Straight Traversal + B Reverse Traversal * Trees + B Depth-First Search (DFS) + B Breadth-First Search (BFS) * Graphs + B Depth-First Search (DFS) + B Breadth-First Search (BFS) + B Kruskal's Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graph + A Dijkstra Algorithm - finding the shortest paths to all graph vertices from single vertex + A Bellman-Ford Algorithm - finding the shortest paths to all graph vertices from single vertex + A Floyd-Warshall Algorithm - find the shortest paths between all pairs of vertices + A Detect Cycle - for both directed and undirected graphs (DFS and Disjoint Set based versions) + A Prim's Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graph + A Topological Sorting - DFS method + A Articulation Points - Tarjan's algorithm (DFS based) + A Bridges - DFS based algorithm + A Eulerian Path and Eulerian Circuit - Fleury's algorithm - Visit every edge exactly once + A Hamiltonian Cycle - Visit every vertex exactly once + A Strongly Connected Components - Kosaraju's algorithm + A Travelling Salesman Problem - shortest possible route that visits each city and returns to the origin city * Cryptography + B Polynomial Hash - rolling hash function based on polynomial + B Rail Fence Cipher - a transposition cipher algorithm for encoding messages + B Caesar Cipher - simple substitution cipher + B Hill Cipher - substitution cipher based on linear algebra * Machine Learning + B NanoNeuron - 7 simple JS functions that illustrate how machines can actually learn (forward/backward propagation) + B k-NN - k-nearest neighbors classification algorithm + B k-Means - k-Means clustering algorithm * Image Processing + B Seam Carving - content-aware image resizing algorithm * Statistics + B Weighted Random - select the random item from the list based on items' weights * Evolutionary algorithms + A Genetic algorithm - example of how the genetic algorithm may be applied for training the self-parking cars * Uncategorized + B Tower of Hanoi + B Square Matrix Rotation - in-place algorithm + B Jump Game - backtracking, dynamic programming (top-down + bottom-up) and greedy examples + B Unique Paths - backtracking, dynamic programming and Pascal's Triangle based examples + B Rain Terraces - trapping rain water problem (dynamic programming and brute force versions) + B Recursive Staircase - count the number of ways to reach to the top (4 solutions) + B Best Time To Buy Sell Stocks - divide and conquer and one-pass examples + A N-Queens Problem + A Knight's Tour Algorithms by Paradigm An algorithmic paradigm is a generic method or approach which underlies the design of a class of algorithms. It is an abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a computer program. * Brute Force - look at all the possibilities and selects the best solution + B Linear Search + B Rain Terraces - trapping rain water problem + B Recursive Staircase - count the number of ways to reach to the top + A Maximum Subarray + A Travelling Salesman Problem - shortest possible route that visits each city and returns to the origin city + A Discrete Fourier Transform - decompose a function of time (a signal) into the frequencies that make it up * Greedy - choose the best option at the current time, without any consideration for the future + B Jump Game + A Unbound Knapsack Problem + A Dijkstra Algorithm - finding the shortest path to all graph vertices + A Prim's Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graph + A Kruskal's Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graph * Divide and Conquer - divide the problem into smaller parts and then solve those parts + B Binary Search + B Tower of Hanoi + B Pascal's Triangle + B Euclidean Algorithm - calculate the Greatest Common Divisor (GCD) + B Merge Sort + B Quicksort + B Tree Depth-First Search (DFS) + B Graph Depth-First Search (DFS) + B Matrices - generating and traversing the matrices of different shapes + B Jump Game + B Fast Powering + B Best Time To Buy Sell Stocks - divide and conquer and one-pass examples + A Permutations (with and without repetitions) + A Combinations (with and without repetitions) + A Maximum Subarray * Dynamic Programming - build up a solution using previously found sub-solutions + B Fibonacci Number + B Jump Game + B Unique Paths + B Rain Terraces - trapping rain water problem + B Recursive Staircase - count the number of ways to reach to the top + B Seam Carving - content-aware image resizing algorithm + A Levenshtein Distance - minimum edit distance between two sequences + A Longest Common Subsequence (LCS) + A Longest Common Substring + A Longest Increasing Subsequence + A Shortest Common Supersequence + A 0/1 Knapsack Problem + A Integer Partition + A Maximum Subarray + A Bellman-Ford Algorithm - finding the shortest path to all graph vertices + A Floyd-Warshall Algorithm - find the shortest paths between all pairs of vertices + A Regular Expression Matching * Backtracking - similarly to brute force, try to generate all possible solutions, but each time you generate next solution you test if it satisfies all conditions, and only then continue generating subsequent solutions. Otherwise, backtrack, and go on a different path of finding a solution. Normally the DFS traversal of state-space is being used. + B Jump Game + B Unique Paths + B Power Set - all subsets of a set + A Hamiltonian Cycle - Visit every vertex exactly once + A N-Queens Problem + A Knight's Tour + A Combination Sum - find all combinations that form specific sum * Branch & Bound - remember the lowest-cost solution found at each stage of the backtracking search, and use the cost of the lowest-cost solution found so far as a lower bound on the cost of a least-cost solution to the problem, in order to discard partial solutions with costs larger than the lowest-cost solution found so far. Normally BFS traversal in combination with DFS traversal of state-space tree is being used. How to use this repository Install all dependencies npm install Run ESLint You may want to run it to check code quality. npm run lint Run all tests npm test Run tests by name npm test -- 'LinkedList' Troubleshooting If linting or testing is failing, try to delete the node_modules folder and re-install npm packages: rm -rf ./node_modules npm i Also make sure that you're using a correct Node version (>=16). If you're using nvm for Node version management you may run nvm use from the root folder of the project and the correct version will be picked up. Playground You may play with data-structures and algorithms in ./src/playground/ playground.js file and write tests for it in ./src/playground/ __test__/playground.test.js. Then just simply run the following command to test if your playground code works as expected: npm test -- 'playground' Useful Information References * > Data Structures and Algorithms on YouTube * Data Structure Sketches Big O Notation Big O notation is used to classify algorithms according to how their running time or space requirements grow as the input size grows. On the chart below you may find most common orders of growth of algorithms specified in Big O notation. Big O graphs Source: Big O Cheat Sheet. Below is the list of some of the most used Big O notations and their performance comparisons against different sizes of the input data. Big O Computations Computations Computations for Notation Type for 10 elements for 100 1000 elements elements O(1) Constant 1 1 1 O(log N) Logarithmic 3 6 9 O(N) Linear 10 100 1000 O(N log n log(n) 30 600 9000 N) O(N^2) Quadratic 100 10000 1000000 O(2^N) Exponential 1024 1.26e+29 1.07e+301 O(N!) Factorial 3628800 9.3e+157 4.02e+2567 Data Structure Operations Complexity Data Access Search Insertion Deletion Comments Structure Array 1 n n n Stack n n 1 1 Queue n n 1 1 Linked n n 1 n List Hash In case of perfect hash Table - n n n function costs would be O (1) Binary In case of balanced tree Search n n n n costs would be O(log(n)) Tree B-Tree log(n) log(n) log(n) log(n) Red-Black log(n) log(n) log(n) log(n) Tree AVL Tree log(n) log(n) log(n) log(n) Bloom - 1 1 - False positives are Filter possible while searching Array Sorting Algorithms Complexity Name Best Average Worst Memory Stable Comments Bubble n n^2 n^2 1 Yes sort Insertion n n^2 n^2 1 Yes sort Selection n^2 n^2 n^2 1 No sort Heap sort n log n log(n) n log 1 No (n) (n) Merge n log n log(n) n log n Yes sort (n) (n) Quick n log Quicksort is usually sort (n) n log(n) n^2 log(n) No done in-place with O (log(n)) stack space depends n Shell n log on gap (log 1 No sort (n) sequence (n))^ 2 Counting n + r n + r n + r n + r Yes r - biggest number in sort array Radix n * k n * k n * k n + k Yes k - length of longest sort key Project Backers You may support this project via [?][?] GitHub or [?][?] Patreon. Folks who are backing this project [?] = 1 Author @trekhleb A few more projects and articles about JavaScript and algorithms on trekhleb.dev About Algorithms and data structures implemented in JavaScript with explanations and links to further readings Topics javascript computer-science algorithm algorithms interview data-structures interview-preparation javascript-algorithms Resources Readme License MIT license Code of conduct Code of conduct Stars 167k stars Watchers 4.4k watching Forks 27.5k forks Report repository Releases No releases published Sponsor this project * * patreon patreon.com/trekhleb Learn more about GitHub Sponsors Packages 0 No packages published Used by 1 * @KasperiP @KasperiP / KasperiP Contributors 199 * @trekhleb * @alexstulov * @m-maksyutin * @appleJax * @albertstill * @moshejs * @tapaswenipathak * @niltonslf * @RequireSun * @tusba * @jpvg10 + 188 contributors Languages * JavaScript 100.0% Footer (c) 2023 GitHub, Inc. Footer navigation * Terms * Privacy * Security * Status * Docs * Contact GitHub * Pricing * API * Training * Blog * About You can't perform that action at this time. You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session.