programming

All DS required for competitive programming

1. SegmentTree - for range queries
2. BitTrie - a trie of bits finding the max-xor value
3. FloydWarshall - all pairs shortest path
4. FordFulkerson - max Flow
5. SuffixTree - a trie of chars - checks if suffix of the current string is part of the trie(dictionary).
6. xor_cipher - decrypter for an XOR cipher