| Shortest Palindrome | Hard | 41.9% |
| Strings Differ by One Character | Medium | 40.1% |
| Check If a String Contains All Binary Codes of Size K | Medium | 61.5% |
| Longest Happy Prefix | Hard | 51.9% |
| Repeated DNA Sequences | Medium | 52.9% |
| Longest Duplicate Substring | Hard | 31.1% |
| Maximum Length of Repeated Subarray | Medium | 51.3% |
| Longest Repeating Substring | Medium | 63.4% |
| K Divisible Elements Subarrays | Medium | 54.8% |
| Longest Common Subpath | Hard | 29.4% |
| Sum of Scores of Built Strings | Hard | 46.7% |
| Number of Subarrays That Match a Pattern I | Medium | 68.4% |
| Count Prefix and Suffix Pairs II | Hard | 28.1% |
| Count Prefix and Suffix Pairs I | Easy | 77.8% |
| Number of Subarrays That Match a Pattern II | Hard | 33.4% |
| Number of Distinct Substrings in a String | Medium | 64.8% |
| Find Beautiful Indices in the Given Array I | Medium | 40.5% |
| Maximum Deletions on a String | Hard | 35.7% |
| Unique Substrings With Equal Digit Frequency | Medium | 64.6% |
| Find Beautiful Indices in the Given Array II | Hard | 27.6% |
| Count Cells in Overlapping Horizontal and Vertical Substrings | Medium | 27.0% |
| Longest Chunked Palindrome Decomposition | Hard | 59.0% |
| Distinct Echo Substrings | Hard | 53.0% |
| Find Substring With Given Hash Value | Hard | 26.0% |
| Minimum Number of Valid Strings to Form Target I | Medium | 21.7% |
| Minimum Time to Revert Word to Initial State II | Hard | 35.1% |
| Minimum Time to Revert Word to Initial State I | Medium | 42.3% |
| Find Pattern in Infinite Stream I | Medium | 56.6% |
| Find Pattern in Infinite Stream II | Hard | 67.5% |