String AC Automaton¶
Table of Contents¶
- 1032. Stream of Characters (Hard)
- 1408. String Matching in an Array (Easy)
- 3213. Construct String with Minimum Cost (Hard)
- 3292. Minimum Number of Valid Strings to Form Target II (Hard)
1032. Stream of Characters¶
1408. String Matching in an Array¶
3213. Construct String with Minimum Cost¶
3292. Minimum Number of Valid Strings to Form Target II¶
-
Tags: Array, String, Binary Search, Dynamic Programming, Segment Tree, Rolling Hash, String Matching, Hash Function