π‘ Practice implementing Data Structures and Algorithms in JavaScript for free on GreatFrontEnd π‘
Common Data Structures and Algorithms implementations in JavaScript.
- List
- Stack
- Queue
- Double-ended Queue
- Trie
- Binary Tree
- Binary Search Tree
- N-D array
- Bloom Filter
- Disjoint-set
- Counter
- Graph (map-based)
- Priority Queue
- AVL Tree
- Heap
- Suffix Tree (Help Wanted!)
- Segment Tree (Help Wanted!)
- Binary Search
- Quickselect
- Merge Sort
- Quicksort
- Heap Sort
- Topological Sort
- Breadth-first Search
- Depth-first Search
- Dijkstra's Algorithm
- Floyd-Warshall Algorithm
- Bellman-Ford Algorithm
$ yarn install
$ yarn test --watch
Before pushing/submitting PR
$ yarn check-all