Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/ivanproskuryakov/algorithms-ts
leetcode algorithms in TS
https://github.com/ivanproskuryakov/algorithms-ts
Last synced: 26 days ago
JSON representation
leetcode algorithms in TS
- Host: GitHub
- URL: https://github.com/ivanproskuryakov/algorithms-ts
- Owner: ivanproskuryakov
- Created: 2022-12-18T16:12:38.000Z (almost 2 years ago)
- Default Branch: master
- Last Pushed: 2024-07-20T14:45:58.000Z (4 months ago)
- Last Synced: 2024-07-21T16:20:41.088Z (4 months ago)
- Language: TypeScript
- Homepage: https://leetcode.com/problemset/
- Size: 101 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
### Data Structures
```
Set
Store unique values, without any particular order
Dynamic/mutable sets
Allow insertion and deletion of elements from the set
Static
Unordered, unchangeable, and unindexed collection
HashSet
HashSet stores unique elements without any associated values
List
Finite number of ordered values, where the same value may occur more than once
append O(1)
space O(n)
Stack
A linear structure that stores items in LIFO manner
push O(1)
pop O(1)
space O(n)
Queue
A linear structure that stores items in FIFO manner
enqueue O(1)
dequeue O(1)
space O(n)
Priority queue
Map
A Map holds key-value pairs where the keys can be any datatype.
A Map remembers the original insertion order of the keys.
search O(1)
insert O(1)
delete O(1)
space O(n)
Hash Map/Hash Table
HashMap stores key-value pairs where the keys are unique identifiers and the values are associated data
UnOrdered Map
Ordered Map
Tree Map
Linked Hash Map
Bloom Filter Map
Hash
Bloom filter
Rate Limit Nullifier
DHT (Distributed hash table)
Graph
A graph can be connected or disconnected, can have cycles or loops, and does not necessarily have a root node
Tree
A tree is a type of graph that is connected, acyclic (meaning it has no cycles or loops), and has a single root node.
- Search O(log _n_)
- Insert O(log _n_)
- Delete O(log _n_)
Binary Tree
Balanced binary tree (BST)
Merkel Tree
Heap
A Heap is a special Tree-based data structure in which the tree is a complete binary tree.
```
### Algorythms
```
Search
Graph
Dijkstra's algorithm
Minimum spanning tree
List
Linear Search
Linear Search Sentinel
Jump search
Binary Search
Interpolation search
Exponential Search
Jump search
Ternary search
Tree traversal
Sort
List
Heapsort
Merge sort
Selection sort
Smooth sort
Hashing
Bloom filters
Merkel Trees
BFS & DFS
Recursive
Divide and conquer
Greedy algorithm
Backtracking
Dynamic programming
Algorithm design paradigm
Branch and bound
Brute-force search
Recursion
Prune and search
Optimisation
Linear programming
```