String Z Function¶
Table of Contents¶
- 2223. Sum of Scores of Built Strings (Hard)
- 3031. Minimum Time to Revert Word to Initial State II (Hard)
- 3045. Count Prefix and Suffix Pairs II (Hard)
- 3303. Find the Occurrence of First Almost Equal Substring (Hard)
- 3292. Minimum Number of Valid Strings to Form Target II (Hard)
- 2430. Maximum Deletions on a String (Hard)
- 3388. Count Beautiful Splits in an Array (Medium)
- 1977. Number of Ways to Separate Numbers (Hard)
2223. Sum of Scores of Built Strings¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: string, binary search, rolling hash, suffix array, string matching, hash function
3031. Minimum Time to Revert Word to Initial State II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: string, rolling hash, string matching, hash function
3045. Count Prefix and Suffix Pairs II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, string, trie, rolling hash, string matching, hash function
3303. Find the Occurrence of First Almost Equal Substring¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: string, string matching
3292. Minimum Number of Valid Strings to Form Target II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, string, binary search, dynamic programming, segment tree, rolling hash, string matching, hash function
2430. Maximum Deletions on a String¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: string, dynamic programming, rolling hash, string matching, hash function
3388. Count Beautiful Splits in an Array¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming
1977. Number of Ways to Separate Numbers¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: string, dynamic programming, suffix array