| Shortest Palindrome | Hard | 41.8% |
| Repeated DNA Sequences | Medium | 52.9% |
| Encode and Decode TinyURL | Medium | 86.6% |
| Subtree of Another Tree | Easy | 51.2% |
| Maximum Length of Repeated Subarray | Medium | 51.2% |
| Design HashSet | Easy | 67.7% |
| Design HashMap | Easy | 66.4% |
| Longest Duplicate Substring | Hard | 31.1% |
| Longest Happy Prefix | Hard | 51.6% |
| Longest Common Subpath | Hard | 29.3% |
| Sum of Scores of Built Strings | Hard | 46.5% |
| K Divisible Elements Subarrays | Medium | 54.8% |
| Number of Subarrays That Match a Pattern I | Medium | 68.4% |
| Delete Duplicate Folders in System | Hard | 77.7% |
| Number of Subarrays That Match a Pattern II | Hard | 33.3% |
| Count Prefix and Suffix Pairs II | Hard | 28.0% |
| Count Prefix and Suffix Pairs I | Easy | 77.8% |
| Find Beautiful Indices in the Given Array I | Medium | 40.5% |
| Maximum Deletions on a String | Hard | 35.7% |
| Distinct Echo Substrings | Hard | 52.9% |
| Longest Chunked Palindrome Decomposition | Hard | 59.0% |
| Check If a String Contains All Binary Codes of Size K | Medium | 56.9% |
| Find Beautiful Indices in the Given Array II | Hard | 27.6% |
| Check if DFS Strings Are Palindromes | Hard | 20.1% |
| Count Cells in Overlapping Horizontal and Vertical Substrings | Medium | 26.9% |
| Find Substring With Given Hash Value | Hard | 25.9% |
| Minimum Number of Valid Strings to Form Target I | Medium | 21.7% |
| Minimum Time to Revert Word to Initial State II | Hard | 35.0% |
| Minimum Time to Revert Word to Initial State I | Medium | 42.3% |