| 749 | Shortest Completing Word | Medium |
| 815 | Bus Routes | Hard |
| 823 | Binary Trees With Factors | Medium |
| 859 | Buddy Strings | Easy |
| 997 | Find the Town Judge | Easy |
| 1048 | Longest String Chain | Medium |
| 1074 | Number of Submatrices That Sum to Target | Hard |
| 1160 | Find Words That Can Be Formed by Characters | Easy |
| 1207 | Unique Number of Occurrences | Easy |
| 1282 | Group the People Given the Group Size They Belong To | Medium |
| 1347 | Minimum Number of Steps to Make Two Strings Anagram | Medium |
| 1436 | Destination City | Easy |
| 1443 | Minimum Time to Collect All Apples in a Tree | Medium |
| 1481 | Least Number of Unique Integers after K Removals | Medium |
| 1496 | Path Crossing | Easy |
| 1512 | Number of Good Pairs | Easy |
| 1624 | Largest Substring Between Two Equal Characters | Easy |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | Medium |
| 1658 | Minimum Operations to Reduce X to Zero | Medium |
| 1743 | Restore the Array From Adjacent Pairs | Medium |
| 1814 | Count Nice Pairs in an Array | Medium |
| 1897 | Redistribute Characters to Make All Strings Equal | Easy |
| 1930 | Unique Length-3 Palindromic Subsequences | Medium |
| 2196 | Create Binary Tree From Descriptions | Medium |
| 2215 | Find the Difference of Two Arrays | Easy |
| 2244 | Minimum Rounds to Complete All Tasks | Medium |
| 2251 | Number of Flowers in Full Bloom | Hard |
| 2353 | Design a Food Rating System | Medium |
| 2374 | Node With Highest Edge Score | Medium |
| 2384 | Largest Palindromic Number | Medium |