Do not copy Try by yourself !!

A collection of my implementations and Personal Experiences.

1.Point Update Range Query 2.Range Update Range Query 3.Order Statistic Query 4.2D Binary Indexed Trees 5.Segment Trees (SegTree) : Point Update Range Query Fast Iterative Segtrees Range Update Point Query - Lazy Propogation 6.Max subsegment sum in range 7.2D Segment Trees 8.Dynamic Segment Trees - Insertion/Deletion between elements 9.Dynamic Segment Trees - Reverse a segment 10.Merge Sort Trees : Merge sort trees Merge sort trees - Order Statistics 11.Sparse Table : 12.Range Minimum Query 13.Mo Algorithm - Arrays

1.shortest paths 2.maximum flow 3.maximum matching 4.spanning tree 5.connectivity 6.biconnectivity 7.LCA

1.segment tree 2.Fenwick tree 3.persistent tree 4.link/cut tree 5.binary heap 6.disjoint-sets, treap

permutations, combinations, arrangements, partitions

String algorithms: suffix tree, suffix automata, suffix array, trie, Aho-Corasick algorithm, Knuth-Morris-Pratt algorithm, Z-function, hashing, parsing

{Contact me for any help at [email protected]}