| 2932 | Maximum Strong Pair XOR I | ArrayHash TableBit Manipulation+2 | Easy |
| 2933 | High-Access Employees | ArrayHash TableString+1 | Medium |
| 2934 | Minimum Operations to Maximize Last Elements in Arrays | ArrayEnumeration | Medium |
| 2935 | Maximum Strong Pair XOR II | ArrayHash TableBit Manipulation+2 | Hard |
| 2937 | Make Three Strings Equal | String | Easy |
| 2938 | Separate Black and White Balls | Two PointersStringGreedy | Medium |
| 2939 | Maximum Xor Product | MathGreedyBit Manipulation | Medium |
| 2940 | Find Building Where Alice and Bob Can Meet | ArrayBinary SearchStack+4 | Hard |
| 2942 | Find Words Containing Character | ArrayString | Easy |
| 2943 | Maximize Area of Square Hole in Grid | ArraySorting | Medium |
| 2944 | Minimum Number of Coins for Fruits | ArrayDynamic ProgrammingQueue+2 | Medium |
| 2945 | Find Maximum Non-decreasing Array Length | ArrayBinary SearchDynamic Programming+4 | Hard |
| 2946 | Matrix Similarity After Cyclic Shifts | ArrayMathMatrix+1 | Easy |
| 2947 | Count Beautiful Substrings I | Hash TableMathString+3 | Medium |
| 2948 | Make Lexicographically Smallest Array by Swapping Elements | ArrayUnion FindSorting | Medium |
| 2949 | Count Beautiful Substrings II | Hash TableMathString+2 | Hard |
| 2951 | Find the Peaks | ArrayEnumeration | Easy |
| 2952 | Minimum Number of Coins to be Added | ArrayGreedySorting | Medium |
| 2953 | Count Complete Substrings | Hash TableStringSliding Window | Hard |
| 2954 | Count the Number of Infection Sequences | ArrayMathCombinatorics | Hard |
| 2956 | Find Common Elements Between Two Arrays | ArrayHash Table | Easy |
| 2957 | Remove Adjacent Almost-Equal Characters | StringDynamic ProgrammingGreedy | Medium |
| 2958 | Length of Longest Subarray With at Most K Frequency | ArrayHash TableSliding Window | Medium |
| 2959 | Number of Possible Sets of Closing Branches | Bit ManipulationGraphHeap (Priority Queue)+2 | Hard |
| 2960 | Count Tested Devices After Test Operations | ArraySimulationCounting | Easy |
| 2961 | Double Modular Exponentiation | ArrayMathSimulation | Medium |
| 2962 | Count Subarrays Where Max Element Appears at Least K Times | ArraySliding Window | Medium |
| 2963 | Count the Number of Good Partitions | ArrayHash TableMath+1 | Hard |
| 2965 | Find Missing and Repeated Values | ArrayHash TableMath+1 | Easy |
| 2966 | Divide Array Into Arrays With Max Difference | ArrayGreedySorting | Medium |
| 2967 | Minimum Cost to Make Array Equalindromic | ArrayMathBinary Search+2 | Medium |
| 2968 | Apply Operations to Maximize Frequency Score | ArrayBinary SearchSliding Window+2 | Hard |
| 2970 | Count the Number of Incremovable Subarrays I | ArrayTwo PointersBinary Search+1 | Easy |
| 2971 | Find Polygon With the Largest Perimeter | ArrayGreedySorting+1 | Medium |
| 2972 | Count the Number of Incremovable Subarrays II | ArrayTwo PointersBinary Search | Hard |
| 2973 | Find Number of Coins to Place in Tree Nodes | Dynamic ProgrammingTreeDepth-First Search+2 | Hard |
| 2974 | Minimum Number Game | ArraySortingHeap (Priority Queue)+1 | Easy |
| 2975 | Maximum Square Area by Removing Fences From a Field | ArrayHash TableEnumeration | Medium |
| 2976 | Minimum Cost to Convert String I | ArrayStringGraph+1 | Medium |
| 2977 | Minimum Cost to Convert String II | ArrayStringDynamic Programming+3 | Hard |
| 2980 | Check if Bitwise OR Has Trailing Zeros | ArrayBit Manipulation | Easy |
| 2981 | Find Longest Special Substring That Occurs Thrice I | Hash TableStringBinary Search+2 | Medium |
| 2982 | Find Longest Special Substring That Occurs Thrice II | Hash TableStringBinary Search+2 | Medium |
| 2983 | Palindrome Rearrangement Queries | Hash TableStringPrefix Sum | Hard |
| 2996 | Smallest Missing Integer Greater Than Sequential Prefix Sum | ArrayHash TableSorting | Easy |
| 2997 | Minimum Number of Operations to Make Array XOR Equal to K | ArrayBit Manipulation | Medium |
| 2998 | Minimum Number of Operations to Make X and Y Equal | Dynamic ProgrammingBreadth-First SearchMemoization | Medium |
| 2999 | Count the Number of Powerful Integers | MathStringDynamic Programming | Hard |
| 3000 | Maximum Area of Longest Diagonal Rectangle | Array | Easy |
| 3001 | Minimum Moves to Capture The Queen | MathEnumeration | Medium |