Advanced Recursion Depth Topics
Advanced concepts related to recursion depth, including dynamic programming and backtracking.
Advanced concepts related to recursion depth, including dynamic programming and backtracking.
An efficient string searching algorithm that searches for multiple patterns simultaneously using an automaton.
A comprehensive guide to Disjoint Set Union (DSU) with visual diagrams, Path Compression, Union by Rank optimizations, step-by-step dry-runs, code templates in Python, Java, and C++, and practice problems.
A hashing technique used heavily in string matching algorithms like Rabin-Karp.
A comprehensive guide to Segment Trees with visual diagrams, build/query/update operations, lazy propagation, code templates in Python, Java, and C++, and practice problems.
A sorted array of all suffixes of a string, extremely useful for fast string queries.
A comprehensive guide to the Trie (Prefix Tree) data structure with visual diagrams, Insert, Search, Delete, and AutoComplete implementations in Python, Java, and C++, and practice problems.
A linear time string matching algorithm that finds all occurrences of a pattern in a text.