Welcome to DSA Templates!
Collection of data structures and algos implementations in Python 3 and Rust
Note
You can see code of all functions on this site by clicking on [source] as usual in tech docs. Maybe it is not the best approach to show implementations of algos and data structures and I should add more explicit code snippets. Hope this website will be useful for your journey in the world of algorithms and data structures.
Indices and tables
Contents:
- Stack
- Queue and Deque
- Generate all possible substructures of a given structure
- Binary search
- Binary Tree
- Algos on graph
- Trie
- Dynamic Programming
- Backtracking
- Union Find (Disjoint Set)
- Minimum Spanning Tree
- Fenwick Tree
- Segment Tree
- Sparse Table
- Sorted List
- Interval Tree
- Suffix Automaton
- Rolling Hash
- Bit Manipulation
- Mo’s Algorithm
- Heavy-Light Decomposition
- Centroid Decomposition
- Breadth-First Search
- Depth-First Search
- Dijkstra’s Algorithm
- Topological Sort
- MultiSet
- Examples of One-liners
- Math Utilities