Repository with implementations and explanations of the following data structures and algorithms.
- Binary search
- Jump search
- Exponential search
- Ternary search
- Quick select
- Selection sort
- Bubble sort
- Insertion sort
- Quick sort
- Merge sort
- Heap sort
- Counting sort
- Radix sort
- Linked list
- Doubly linked list
- Stack
- Queue
- Heap
- Hash table
- DFS
- BFS
- Topological sort
- Find cycles
- Number of paths of fixed length
- Find bridges
- Find articulation points
- Dijkstra
- Belman Ford
- Floyd Warshall
- Prim
- Kruskal
- Max flow (Edmonds Karp)
- Shortest Path Faster Algorithm (SPFA)
- Strongly connected components (Koraraju)
- Boolean 2 satisfiability (2-SAT)
- K-th ancestor
- Lowest common ancestor (LCA)
- Max flow (Dinic)
- Max flow (MPM)
- Min cost max flow (assignment problem)
- Virtual tree
- A*
- Rolling hash
- Rabin Karp
- Trie (Prefix Tree)
- Knuth Morris Pratt (KMP)
- Aho corasick (KMP Generalization)
- Suffix array
- Hash segment tree
- Sqrt decomposition
- Sparse table
- 2D Sparse table
- Fenwick tree (BITree)
- Segment tree
- 2D Segment Tree
- Merge sort segment tree
- Implicit treap
- Persitent array
- Persistent segment tree
- Fast pow
- Matrix fast pow
- Sieve of Eratosthenes
- Fast Fourier transform
- Convex hull (Graham Scan)
- KD tree
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent