- Disjoint set union
- Dijkstra algorithm
- Longest increasing subsequence
- Next/Previous smaller/greater element
- Longest common subsequence (find string)
- Tries
- Primes
- Smallest Prime Factor
- Binomial Coefficients
- Lowest Common Ancestor(binary lifting)
- Coordinate Compressor
- Iterative segment tree
- Lazy Segment Tree - range add, range max
- Lazy Segment Tree - range add, range sum
- Lazy Segment Tree - range assign, range sum
- String splitter
- Bridge finder in undirected graph(Tarjan's algo)
- String : prefix and suffix function
-
Notifications
You must be signed in to change notification settings - Fork 0
yash30201/snippets
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This repo contains code snippets in C++ for various standard Data structures and algorithms.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published