CodeSamur.aiStart

String Algorithms, Advanced DP & Competitive Techniques

32 lessons

Segment Trees cover

Fenwick Trees cover

Sqrt Decomposition cover

String Matching cover

Z-Algorithm & Manacher cover

Aho-Corasick cover

Trie Data Structure cover

Suffix Arrays cover

Suffix Automaton cover

Longest Common Substring cover

Edit Distance cover

Bioinformatics &<br>Computational Biology cover

String Hashing cover

Coin Change cover

The Knapsack Problem cover

Longest Increasing Subsequence cover

Matrix Chain Multiplication cover

Palindrome Partitioning cover

Bitmask DP cover

Computational Geometry cover

Advanced Computational Geometry cover

Reservoir Sampling cover

Probability & Expected Value cover

Combinatorics & Counting cover

Lowest Common Ancestor cover

Articulation Points & Bridges cover

2-SAT cover

Heavy-Light Decomposition cover

Matrix Exponentiation cover

Tree DP cover

Digit DP cover

FFT & NTT cover

Questions or feedback?