| 28 | Find the Index of the First Occurrence in a String | — | Easy | Two PointersStringString Matching | 45% | |
| 214 | Shortest Palindrome | — | Hard | StringRolling HashString Matching | 41% | |
| 459 | Repeated Substring Pattern | — | Easy | StringString Matching | 47% | |
| 572 | Subtree of Another Tree | — | Easy | TreeDepth-First SearchString Matching | 50% | |
| 686 | Repeated String Matchread | — | Medium | StringString Matching | 37% | |
| 796 | Rotate Stringread | — | Easy | StringString Matching | 64% | |
| 1023 | Camelcase Matching | — | Medium | ArrayTwo PointersString | 64% | |
| 1392 | Longest Happy Prefixread | — | Hard | StringRolling HashString Matching | 49% | |
| 1397 | Find All Good Stringsread | — | Hard | StringDynamic ProgrammingString Matching | 44% | |
| 1408 | String Matching in an Arrayread | — | Easy | ArrayStringString Matching | 70% | |
| 1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentenceread | — | Easy | Two PointersStringString Matching | 69% | |
| 1668 | Maximum Repeating Substringread | — | Easy | StringDynamic ProgrammingString Matching | 40% | |
| 1764 | Form Array by Concatenating Subarrays of Another Array | — | Medium | ArrayTwo PointersGreedy | 54% | |
| 2185 | Counting Words With a Given Prefix | — | Easy | ArrayStringString Matching | 85% | |
| 2223 | Sum of Scores of Built Stringsread | — | Hard | StringBinary SearchRolling Hash | 42% | |
| 2301 | Match Substring After Replacementread | — | Hard | ArrayHash TableString | 42% | |
| 2430 | Maximum Deletions on a String | — | Hard | StringDynamic ProgrammingRolling Hash | 34% | |
| 2851 | String Transformationread | — | Hard | MathStringDynamic Programming | 25% | |
| 3006 | Find Beautiful Indices in the Given Array Iread | — | Medium | Two PointersStringBinary Search | 38% | |
| 3008 | Find Beautiful Indices in the Given Array IIread | — | Hard | Two PointersStringBinary Search | 26% | |
| 3029 | Minimum Time to Revert Word to Initial State Iread | — | Medium | StringRolling HashString Matching | 41% | |
| 3031 | Minimum Time to Revert Word to Initial State IIread | — | Hard | StringRolling HashString Matching | 34% | |
| 3034 | Number of Subarrays That Match a Pattern Iread | — | Medium | ArrayRolling HashString Matching | 67% | |
| 3036 | Number of Subarrays That Match a Pattern IIread | — | Hard | ArrayRolling HashString Matching | 32% | |
| 3042 | Count Prefix and Suffix Pairs I | — | Easy | ArrayStringTrie | 78% | |
| 3045 | Count Prefix and Suffix Pairs II | — | Hard | ArrayStringTrie | 27% | |
| 3291 | Minimum Number of Valid Strings to Form Target Iread | — | Medium | ArrayStringBinary Search | 20% | |
| 3292 | Minimum Number of Valid Strings to Form Target IIread | — | Hard | ArrayStringBinary Search | 18% | |
| 3303 | Find the Occurrence of First Almost Equal Substringread | — | Hard | StringString Matching | 14% | |
| 3407 | Substring Matching Patternread | — | Easy | StringString Matching | 26% | |
| 3455 | Shortest Matching Substringread | — | Hard | Two PointersStringBinary Search | 22% | |
| 3474 | Lexicographically Smallest Generated Stringread | — | Hard | StringGreedyString Matching | 29% | |
| 3529 | Count Cells in Overlapping Horizontal and Vertical Substringsread | — | Medium | ArrayStringRolling Hash | 21% | |