| 1916 | Count Ways to Build Rooms in an Ant Colony | MathDynamic ProgrammingTree+3 | Hard |
| 1920 | Build Array from Permutation | ArraySimulation | Easy |
| 1921 | Eliminate Maximum Number of Monsters | ArrayGreedySorting | Medium |
| 1922 | Count Good Numbers | MathRecursion | Medium |
| 1923 | Longest Common Subpath | ArrayBinary SearchRolling Hash+2 | Hard |
| 1925 | Count Square Sum Triples | MathEnumeration | Easy |
| 1926 | Nearest Exit from Entrance in Maze | ArrayBreadth-First SearchMatrix | Medium |
| 1927 | Sum Game | MathStringGreedy+1 | Medium |
| 1928 | Minimum Cost to Reach Destination in Time | ArrayDynamic ProgrammingGraph | Hard |
| 1929 | Concatenation of Array | ArraySimulation | Easy |
| 1930 | Unique Length-3 Palindromic Subsequences | Hash TableStringBit Manipulation+1 | Medium |
| 1931 | Painting a Grid With Three Different Colors | Dynamic Programming | Hard |
| 1932 | Merge BSTs to Create Single BST | Hash TableBinary SearchTree+2 | Hard |
| 1934 | Confirmation Rate | Database | Medium |
| 1935 | Maximum Number of Words You Can Type | Hash TableString | Easy |
| 1936 | Add Minimum Number of Rungs | ArrayGreedy | Medium |
| 1937 | Maximum Number of Points with Cost | ArrayDynamic ProgrammingMatrix | Medium |
| 1938 | Maximum Genetic Difference Query | ArrayHash TableBit Manipulation+2 | Hard |
| 1941 | Check if All Characters Have Equal Number of Occurrences | Hash TableStringCounting | Easy |
| 1942 | The Number of the Smallest Unoccupied Chair | ArrayHash TableHeap (Priority Queue) | Medium |
| 1943 | Describe the Painting | ArrayHash TableSorting+1 | Medium |
| 1944 | Number of Visible People in a Queue | ArrayStackMonotonic Stack | Hard |
| 1945 | Sum of Digits of String After Convert | StringSimulation | Easy |
| 1946 | Largest Number After Mutating Substring | ArrayStringGreedy | Medium |
| 1947 | Maximum Compatibility Score Sum | ArrayDynamic ProgrammingBacktracking+2 | Medium |
| 1948 | Delete Duplicate Folders in System | ArrayHash TableString+2 | Hard |
| 1952 | Three Divisors | MathEnumerationNumber Theory | Easy |
| 1953 | Maximum Number of Weeks for Which You Can Work | ArrayGreedy | Medium |
| 1954 | Minimum Garden Perimeter to Collect Enough Apples | MathBinary Search | Medium |
| 1955 | Count Number of Special Subsequences | ArrayDynamic Programming | Hard |
| 1957 | Delete Characters to Make Fancy String | String | Easy |
| 1958 | Check if Move is Legal | ArrayMatrixEnumeration | Medium |
| 1959 | Minimum Total Space Wasted With K Resizing Operations | ArrayDynamic Programming | Medium |
| 1960 | Maximum Product of the Length of Two Palindromic Substrings | StringRolling HashHash Function | Hard |
| 1961 | Check If String Is a Prefix of Array | ArrayTwo PointersString | Easy |
| 1962 | Remove Stones to Minimize the Total | ArrayGreedyHeap (Priority Queue) | Medium |
| 1963 | Minimum Number of Swaps to Make the String Balanced | Two PointersStringStack+1 | Medium |
| 1964 | Find the Longest Valid Obstacle Course at Each Position | ArrayBinary SearchBinary Indexed Tree | Hard |
| 1965 | Employees With Missing Information | Database | Easy |
| 1967 | Number of Strings That Appear as Substrings in Word | ArrayString | Easy |
| 1968 | Array With Elements Not Equal to Average of Neighbors | ArrayGreedySorting | Medium |
| 1969 | Minimum Non-Zero Product of the Array Elements | MathGreedyRecursion | Medium |
| 1970 | Last Day Where You Can Still Cross | ArrayBinary SearchDepth-First Search+3 | Hard |
| 1971 | Find if Path Exists in Graph | Depth-First SearchBreadth-First SearchUnion Find+1 | Easy |
| 1974 | Minimum Time to Type Word Using Special Typewriter | StringGreedy | Easy |
| 1975 | Maximum Matrix Sum | ArrayGreedyMatrix | Medium |
| 1976 | Number of Ways to Arrive at Destination | Dynamic ProgrammingGraphTopological Sort+1 | Medium |
| 1977 | Number of Ways to Separate Numbers | StringDynamic ProgrammingSuffix Array | Hard |
| 1978 | Employees Whose Manager Left the Company | Database | Easy |
| 1979 | Find Greatest Common Divisor of Array | ArrayMathNumber Theory | Easy |