| Find All Good Strings | Hard | 45.1% | 100.0% | StringDynamic ProgrammingString Matching |
| Number of Distinct Substrings in a String | Medium | 64.8% | 100.0% | StringTrieRolling Hash+2 |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 100.0% | ArrayStringDynamic Programming |
| Stone Game VII | Medium | 58.7% | 100.0% | ArrayMathDynamic Programming+1 |
| Ways to Make a Fair Array | Medium | 66.4% | 100.0% | ArrayPrefix Sum |
| Build Array Where You Can Find The Maximum Exactly K Comparisons | Hard | 65.9% | 100.0% | Dynamic ProgrammingPrefix Sum |
| Count Complete Tree Nodes | Easy | 72.1% | 64.1% | Binary SearchBit ManipulationTree+1 |