Algorithms and Data Structures Implemented in ES6 JavaScript by@trekhleb

Algorithms and Data Structures Implemented in ES6 JavaScript

Oleksii Trekhleb HackerNoon profile picture

Oleksii Trekhleb

Software Engineer @ UBER. Author of the 100k ⭐️ javascript-algorithms repository on GitHub.

twitter social icongithub social iconlinkedin social icon

Hello Readers! I’ve launched JavaScript Algorithms and Data Structures repository on GitHub with a collection of classic algorithms and data-structures implemented in ES6 JavaScript with explanations and links to further readings and YouTube videos.

There is also Algorithms and Data Structures YouTube playlist that contains all the videos mentioned in that repository so you may just go and take this hand-made online learning course :)

So I guess you’ve already grasped the main idea of the project — helping developers to learn and practice algorithms and do it in JavaScript.

To make this process even smoother, I’ve tried to put some graphical illustrations for each algorithm and data structure where it was possible just to make the idea behind those algorithms to be easily grasped and memorized.

You also may find some practical information just in the root README file that may be handy while you’re studying. Such information as:

  • big O notation graphs — to see quickly what is worse O(n!) or, let’s say, O(n²)
  • list of some of the most used Big O notations and their performance comparisons — to get the idea of how big is 10! (it is 3628800)
  • data structures operations complexity — how fast are searches, reads, or insertions for different data-structures
  • comparative table of sorting algorithms complexity — to help you choose the proper sorting algorithm in your situation

All code is 100% covered with tests. This is done not only to keep code working correctly but also to give you an illustration of how each algorithm or data structure works, what basic operations they have (let’s say polling for heap), and what are the edge cases (what to do if the graph is directed).

The repository also has a playground. This is just a small function template along with an empty test case that will help you to start testing or working on algorithms just right after cloning the repo.

  • Linked List
  • QueueStack
  • Hash Table
  • Heap
  • Priority Queue
  • Trie
  • Tree (Binary Search Tree, AVL Tree)
  • Graph (both directed and undirected)
  • Disjoint Set

On top of those data structures, more than 50 popular algorithms are implemented. Among them are sorting, searching algorithms, graph/tree/sets/string/math related algorithms. 

All algorithms are also categorized by their paradigms:

  • Brute Force Algorithms — look at all the possibilities and selects the best solution
  • Greedy Algorithms — choose the best option at the current time, without any consideration for the future
  • Divide and Conquer Algorithms — divide the problem into smaller parts and then solve those parts
  • Dynamic Programming Algorithms — build up to a solution using previously found sub-solutions
  • Backtracking Algorithms — similarly to brute force try to generate all possible solutions but each time you generate a solution 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.

I hope this repository will be helpful for you! Enjoy coding!

Previously published at

react to story with heart
react to story with light
react to story with boat
react to story with money

Related Stories

. . . comments & more!