TypeScript-Algorithms-and-Data-Structures

This Repo, at first, was only for JavaScript Algorithms and Data Structures Masterclass.

But the objective of this project has increased, I want to implement algorithms and popular data structures in TypeScript/ JavaScript and solve programming assignments for popular online courses.

For each folder, there is a MD file with my main References for that section.

Algorithms Specialization.

You can found Example Test Cases: stanford-algs.

Programming assignment solutions are not available in order to respect Coursera Honor Code.

Data Structures

Basics:

• Linked List
• Doubly Linked List
• Queue
• Stack

Trees:

• Binary Search Tree
• AVL Tree
• Red Black Tree

Heaps:

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

Hash Tables:

• Separate Chaining

Disjoint-set (Union-Find):

• Linked List Representation
• Forest Representation

Graph:

• 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

Sorting

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

To visualize some of them check Sorting Visualizer

Divide and Conquer

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

Greedy

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

Dynamic Programming

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