JS Algorithms for Coding Interview

This repo contains JavaScript implementations of algorithms and data structures from Coding Interview University study plan. It also includes tests to have some faith that things work 🤞

Implementations mostly based on theory from these courses:

• MIT 6.006 Introduction to Algorithms
• Algorithms course by Robert Sedgewick and Kevin Wayne (Princeton University): Part 1, Part 2

Contents:

• algorithms:
  • binary search
  • insertion sort
  • heapsort
  • quicksort (3-way partitioning + randomized pivot selection)
  • mergesort
  • counting sort
  • radix sort (LSD version to sort numbers)
• data-structures:
  • dynamic array (aka resizable array)
  • linked list (singly-linked list, with and without tail pointer)
  • stack
  • queue
  • heap
  • priority queue
  • binary search tree
  • graph (adjacency list, adjacency matrix)
  • hashtable (open adressing)