Collection of classical algorithms and data structures in TypeScript.

For each folder, there is an MD file with my main References for that section. But my favorite ones are:

• Algorithms Specialization.
  • Example test case files are available in: stanford-algs. Programming assignment solutions are not available in order to respect Coursera Honor Code.
• MIT 6.006 Introduction to Algorithms
• MIT 6.046J Design and Analysis of Algorithms
• Introduction to Algorithms, 3rd Edition - CLRS
• Algorithm Design, 1st Edition

• Linked List
• Doubly Linked List
• Queue
• Stack

• Binary Search Tree
• AVL Tree
• Red Black Tree

• Min Binary Heap
• Max Binary Heap
• Min Fibonacci Heap

• Separate Chaining

• Linked List Representation
• Forest Representation

• Karger Minimum Cut
• BFS
• Undirected connectivity
• DFS
• Topological Sorting
• Kosaraju Strongly Connected Components
• Dijkstra
• Prim
• Kruskal
• Bellman-Ford
• Floyd-Warshall
• Johnson (APSP)
• Ford-Fulkerson

To visualize some Pathfinding Algorithms check: Pathfinding Visualizer

• Bubble Sort
• Insertion Sort
• Selection Sort
• Heap Sort
• Merge Sort
• Quick Sort
• Radix Sort

To visualize some of them check Sorting Visualizer

• Karatsuba Multiplication
• Merge Sort
• Counting Inversions
• Maximum Sum Subarray Problem
• Closest Pair of Points Problem
• Quicksort
• Linear Time Selection: Random and Deterministic

• Dijkstra
• Prim
• Kruskal - Single-Link Clustering
• Scheduling Application
• Huffman Coding
• Nearest Neighbor Heuristic TSP

• Weighted Interval Scheduling
• Max Weight Independent Set
• Knapsack
• Sequence Alignment
• Bellman-Ford
• Floyd-Warshall