Typescript-based Implementation of Data Structures

Plan

1. Each directory inside this repo represents a data structures, inside each directory the actual implementation in typescript in addition to notes related to that DS

2. Each DS has problem sets related to it, those PS are listed inside each dir.

This repo is updated regularly from time to time, if you've any feedback or want to contribute, PRs are welcomed.

Contents

• Basics

• Searching

  • Linear
  • Binary Search
  • Two crystal balls (PS)

• Sorting

  • Bubble Sort
  • LinkedList Data Structure
  • LinkedList Complexity
  • Queue
  • Stack

• Arrays

  • ArrayList
  • AraryBuffer

• Recursion

  • Recursion
  • Path Finding: base case
  • path finding: Recursive case

• QuickSort

• LinkedList

  • Singly

  • Doubly

  • Merge Two linkedLists (PS)

  • Revere linkedlist (PS)

• Tree

  • Binary Search Tree [Iteratively]
  • Binary Search Tree [Recursively]
  • Breadth-First search
  • Depth-first search
  • compare between 2 BST (PS)

• Heap

  • MinHeap implementation
  • Tries

• Graphs

  • Adjacency matrix
  • implementing BFS on Adjacency matrix
  • implementing DFS on Adjacency matrix
  • Dijkstra's shortest path

• Maps

  • mpas
  • LRU cache

Resources

The main resource for me was course by @primegen on FrontendMasters titled "TheLast Algorithms Course You will need" and he was right.

This resource was enough for me, but there are other ones, that might help

Hash Table/Hash Map Data Structure | Interview Cake

Sorting Algorithms - GeeksforGeeks

https://leetcode.com/