| Number of Bit Changes to Make Two Integers Equal | Easy | 63.3% | 100.0% | Bit Manipulation |
| Maximum GCD-Sum of a Subarray | Hard | 38.5% | 100.0% | |
| Maximize the Number of Partitions After Operations | Hard | 53.6% | 100.0% | StringDynamic ProgrammingBit Manipulation+1 |
| Number of Subarrays That Match a Pattern II | Hard | 33.3% | 100.0% | ArrayRolling HashString Matching+1 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 62.5% | ArrayDynamic Programming |
| Longest Palindromic Substring | Medium | 37.3% | 62.5% | Two PointersStringDynamic Programming |
| Two Sum | Easy | 57.1% | 62.5% | ArrayHash Table |