| 187 | Repeated DNA Sequences | — | Medium | Hash TableStringBit Manipulation | 51% | |
| 214 | Shortest Palindrome | — | Hard | StringRolling HashString Matching | 41% | |
| 718 | Maximum Length of Repeated Subarray | — | Medium | ArrayBinary SearchDynamic Programming | 51% | |
| 1044 | Longest Duplicate Substring | — | Hard | StringBinary SearchSliding Window | 31% | |
| 1147 | Longest Chunked Palindrome Decomposition | — | Hard | Two PointersStringDynamic Programming | 59% | |
| 1316 | Distinct Echo Substrings | — | Hard | StringTrieRolling Hash | 52% | |
| 1392 | Longest Happy Prefix | — | Hard | StringRolling HashString Matching | 49% | |
| 1461 | Check If a String Contains All Binary Codes of Size K | — | Medium | Hash TableStringBit Manipulation | 57% | |
| 1923 | Longest Common Subpathread | — | Hard | ArrayBinary SearchRolling Hash | 28% | |
| 1960 | Maximum Product of the Length of Two Palindromic Substrings | — | Hard | StringRolling HashHash Function | 30% | |
| 2156 | Find Substring With Given Hash Value | — | Hard | StringSliding WindowRolling Hash | 25% | |
| 2223 | Sum of Scores of Built Strings | — | Hard | StringBinary SearchRolling Hash | 42% | |
| 2261 | K Divisible Elements Subarrays | — | Medium | ArrayHash TableTrie | 54% | |
| 2430 | Maximum Deletions on a String | — | Hard | StringDynamic ProgrammingRolling Hash | 34% | |
| 3006 | Find Beautiful Indices in the Given Array I | — | Medium | Two PointersStringBinary Search | 38% | |
| 3008 | Find Beautiful Indices in the Given Array II | — | Hard | Two PointersStringBinary Search | 26% | |
| 3029 | Minimum Time to Revert Word to Initial State I | — | Medium | StringRolling HashString Matching | 41% | |
| 3031 | Minimum Time to Revert Word to Initial State II | — | Hard | StringRolling HashString Matching | 34% | |
| 3034 | Number of Subarrays That Match a Pattern I | — | Medium | ArrayRolling HashString Matching | 67% | |
| 3036 | Number of Subarrays That Match a Pattern II | — | 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 I | — | Medium | ArrayStringBinary Search | 20% | |
| 3292 | Minimum Number of Valid Strings to Form Target II | — | Hard | ArrayStringBinary Search | 18% | |
| 3529 | Count Cells in Overlapping Horizontal and Vertical Substrings | — | Medium | ArrayStringRolling Hash | 21% | |