| Search Suggestions System | Medium | 65.2% | 87.5% |
| Check if One String Swap Can Make Strings Equal | Easy | 49.5% | 75.0% |
| Minimum Number of Steps to Make Two Strings Anagram | Medium | 82.5% | 62.5% |
| Next Greater Element III | Medium | 35.1% | 62.5% |
| Buddy Strings | Easy | 33.9% | 62.5% |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 50.0% |
| Word Search II | Hard | 38.1% | 50.0% |
| Basic Calculator | Hard | 46.5% | 50.0% |
| Longest Common Subsequence | Medium | 58.9% | 50.0% |
| Basic Calculator II | Medium | 46.6% | 50.0% |
| Serialize and Deserialize Binary Tree | Hard | 60.3% | 50.0% |
| Subsequence With the Minimum Score | Hard | 33.1% | 50.0% |
| Design Add and Search Words Data Structure | Medium | 48.1% | 37.5% |
| Similar String Groups | Hard | 56.1% | 37.5% |
| Integer to Roman | Medium | 70.4% | 37.5% |
| Group Anagrams | Medium | 72.2% | 25.0% |
| Longest Palindromic Substring | Medium | 37.3% | 25.0% |
| K-Similar Strings | Hard | 40.6% | 25.0% |
| Roman to Integer | Easy | 66.2% | 25.0% |