Category: Algorithms & Data structures
-
Segment Tree
Theory Implementation With lazy propagation Practice problems
-
Bellman-Ford algorithm for shortest paths
Theory Implementation Practice problems
-
Kruskal’s algorithm for minimum spanning trees (MST)
Theory Implementation Practice problems
-
Knuth-Morris-Pratt algorithm for substring search
Theory Implementation Practice problems
-
Rabin-Karp algorithm for substring search
Theory Implementation Practice problems
-
Boyer-Moore algorithm for substring search
Theory Implementation Practice problems
-
C++ split & replace
It’s hard to believe, but after many revisions of the C++ standard, we still don’t have built-in implementations for basic operations like split and replace. See the discussions on Stack Overflow for split and replace. Here are my basic implementations, they should work for most purposes. Split Replace Some tests These implementations seem short and…
-
C++: Unordered maps and sets for non-primitive types
Since C++ 11, we can use unordered sets and unordered maps. However, these data structures only seem to work with primitive types and strings. If you need a pair or a vector as the key, you’re out of luck. Fortunately, it’s possible to use unordered containers with other types, we just have to do some…
-
QuickSelect
Theory Implementation in Java Practice
-
Fenwick tree (aka Binary Indexed Tree)
Theory TopCoder – Binary Indexed Trees Algorithms Live – Fenwick tree Wikipedia – Fenwick tree Implementation in C++ Practice Kattis – Movie collection AtCoder – B Fenwick Tree