| 3002 | Maximum Size of a Set After Removals | ArrayHash TableGreedy | Medium |
| 3003 | Maximize the Number of Partitions After Operations | StringDynamic ProgrammingBit Manipulation+1 | Hard |
| 3005 | Count Elements With Maximum Frequency | ArrayHash TableCounting | Easy |
| 3006 | Find Beautiful Indices in the Given Array I | Two PointersStringBinary Search+3 | Medium |
| 3007 | Maximum Number That Sum of the Prices Is Less Than or Equal to K | Binary SearchDynamic ProgrammingBit Manipulation | Medium |
| 3008 | Find Beautiful Indices in the Given Array II | Two PointersStringBinary Search+3 | Hard |
| 3010 | Divide an Array Into Subarrays With Minimum Cost I | ArraySortingEnumeration | Easy |
| 3011 | Find if Array Can Be Sorted | ArrayBit ManipulationSorting | Medium |
| 3012 | Minimize Length of Array Using Operations | ArrayMathGreedy+1 | Medium |
| 3013 | Divide an Array Into Subarrays With Minimum Cost II | ArrayHash TableSliding Window+1 | Hard |
| 3014 | Minimum Number of Pushes to Type Word I | MathStringGreedy | Easy |
| 3015 | Count the Number of Houses at a Certain Distance I | Breadth-First SearchGraphPrefix Sum | Medium |
| 3016 | Minimum Number of Pushes to Type Word II | Hash TableStringGreedy+2 | Medium |
| 3017 | Count the Number of Houses at a Certain Distance II | GraphPrefix Sum | Hard |
| 3019 | Number of Changing Keys | String | Easy |
| 3020 | Find the Maximum Number of Elements in Subset | ArrayHash TableEnumeration | Medium |
| 3021 | Alice and Bob Playing Flower Game | Math | Medium |
| 3022 | Minimize OR of Remaining Elements Using Operations | ArrayGreedyBit Manipulation | Hard |
| 3024 | Type of Triangle | ArrayMathSorting | Easy |
| 3025 | Find the Number of Ways to Place People I | ArrayMathGeometry+2 | Medium |
| 3026 | Maximum Good Subarray Sum | ArrayHash TablePrefix Sum | Medium |
| 3027 | Find the Number of Ways to Place People II | ArrayMathGeometry+2 | Hard |
| 3028 | Ant on the Boundary | ArraySimulationPrefix Sum | Easy |
| 3029 | Minimum Time to Revert Word to Initial State I | StringRolling HashString Matching+1 | Medium |
| 3030 | Find the Grid of Region Average | ArrayMatrix | Medium |
| 3031 | Minimum Time to Revert Word to Initial State II | StringRolling HashString Matching+1 | Hard |
| 3033 | Modify the Matrix | ArrayMatrix | Easy |
| 3034 | Number of Subarrays That Match a Pattern I | ArrayRolling HashString Matching+1 | Medium |
| 3035 | Maximum Palindromes After Operations | ArrayHash TableString+3 | Medium |
| 3036 | Number of Subarrays That Match a Pattern II | ArrayRolling HashString Matching+1 | Hard |
| 3038 | Maximum Number of Operations With the Same Score I | ArraySimulation | Easy |
| 3039 | Apply Operations to Make String Empty | ArrayHash TableSorting+1 | Medium |
| 3040 | Maximum Number of Operations With the Same Score II | ArrayDynamic ProgrammingMemoization | Medium |
| 3041 | Maximize Consecutive Elements in an Array After Modification | ArrayDynamic ProgrammingSorting | Hard |
| 3042 | Count Prefix and Suffix Pairs I | ArrayStringTrie+3 | Easy |
| 3043 | Find the Length of the Longest Common Prefix | ArrayHash TableString+1 | Medium |
| 3044 | Most Frequent Prime | ArrayHash TableMath+4 | Medium |
| 3045 | Count Prefix and Suffix Pairs II | ArrayStringTrie+3 | Hard |
| 3046 | Split the Array | ArrayHash TableCounting | Easy |
| 3047 | Find the Largest Area of Square Inside Two Rectangles | ArrayMathGeometry | Medium |
| 3048 | Earliest Second to Mark Indices I | ArrayBinary Search | Medium |
| 3049 | Earliest Second to Mark Indices II | ArrayBinary SearchGreedy+1 | Hard |
| 3065 | Minimum Operations to Exceed Threshold Value I | Array | Easy |
| 3066 | Minimum Operations to Exceed Threshold Value II | ArrayHeap (Priority Queue)Simulation | Medium |
| 3067 | Count Pairs of Connectable Servers in a Weighted Tree Network | ArrayTreeDepth-First Search | Medium |
| 3068 | Find the Maximum Sum of Node Values | ArrayDynamic ProgrammingGreedy+3 | Hard |
| 3069 | Distribute Elements Into Two Arrays I | ArraySimulation | Easy |
| 3070 | Count Submatrices with Top-Left Element and Sum Less Than k | ArrayMatrixPrefix Sum | Medium |
| 3071 | Minimum Operations to Write the Letter Y on a Grid | ArrayHash TableMatrix+1 | Medium |
| 3072 | Distribute Elements Into Two Arrays II | ArrayBinary Indexed TreeSegment Tree+1 | Hard |