| 2809 | Minimum Time to Make Array Sum At Most x | ArrayDynamic ProgrammingSorting | Hard |
| 2810 | Faulty Keyboard | StringSimulation | Easy |
| 2811 | Check if it is Possible to Split Array | ArrayDynamic ProgrammingGreedy | Medium |
| 2812 | Find the Safest Path in a Grid | ArrayBinary SearchBreadth-First Search+3 | Medium |
| 2813 | Maximum Elegance of a K-Length Subsequence | ArrayHash TableStack+3 | Hard |
| 2815 | Max Pair Sum in an Array | ArrayHash Table | Easy |
| 2816 | Double a Number Represented as a Linked List | Linked ListMathStack | Medium |
| 2817 | Minimum Absolute Difference Between Elements With Constraint | ArrayBinary SearchOrdered Set | Medium |
| 2818 | Apply Operations to Maximize Score | ArrayMathStack+4 | Hard |
| 2824 | Count Pairs Whose Sum is Less than Target | ArrayTwo PointersBinary Search+1 | Easy |
| 2825 | Make String a Subsequence Using Cyclic Increments | Two PointersString | Medium |
| 2826 | Sorting Three Groups | ArrayBinary SearchDynamic Programming | Medium |
| 2827 | Number of Beautiful Integers in the Range | MathDynamic Programming | Hard |
| 2828 | Check if a String Is an Acronym of Words | ArrayString | Easy |
| 2829 | Determine the Minimum Sum of a k-avoiding Array | MathGreedy | Medium |
| 2830 | Maximize the Profit as the Salesman | ArrayHash TableBinary Search+2 | Medium |
| 2831 | Find the Longest Equal Subarray | ArrayHash TableBinary Search+1 | Medium |
| 2833 | Furthest Point From Origin | StringCounting | Easy |
| 2834 | Find the Minimum Possible Sum of a Beautiful Array | MathGreedy | Medium |
| 2835 | Minimum Operations to Form Subsequence With Target Sum | ArrayGreedyBit Manipulation | Hard |
| 2836 | Maximize Value of Function in a Ball Passing Game | ArrayDynamic ProgrammingBit Manipulation | Hard |
| 2839 | Check if Strings Can be Made Equal With Operations I | String | Easy |
| 2840 | Check if Strings Can be Made Equal With Operations II | Hash TableStringSorting | Medium |
| 2841 | Maximum Sum of Almost Unique Subarray | ArrayHash TableSliding Window | Medium |
| 2842 | Count K-Subsequences of a String With Maximum Beauty | Hash TableMathString+2 | Hard |
| 2843 | Count Symmetric Integers | MathEnumeration | Easy |
| 2844 | Minimum Operations to Make a Special Number | MathStringGreedy+1 | Medium |
| 2845 | Count of Interesting Subarrays | ArrayHash TablePrefix Sum | Medium |
| 2846 | Minimum Edge Weight Equilibrium Queries in a Tree | ArrayTreeGraph+1 | Hard |
| 2848 | Points That Intersect With Cars | ArrayHash TablePrefix Sum | Easy |
| 2849 | Determine if a Cell Is Reachable at a Given Time | Math | Medium |
| 2850 | Minimum Moves to Spread Stones Over Grid | ArrayDynamic ProgrammingBreadth-First Search+1 | Medium |
| 2851 | String Transformation | MathStringDynamic Programming+1 | Hard |
| 2855 | Minimum Right Shifts to Sort the Array | Array | Easy |
| 2856 | Minimum Array Length After Pair Removals | ArrayHash TableTwo Pointers+3 | Medium |
| 2857 | Count Pairs of Points With Distance k | ArrayHash TableBit Manipulation | Medium |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Dynamic ProgrammingDepth-First SearchBreadth-First Search+1 | Hard |
| 2859 | Sum of Values at Indices With K Set Bits | ArrayBit Manipulation | Easy |
| 2860 | Happy Students | ArraySortingEnumeration | Medium |
| 2861 | Maximum Number of Alloys | ArrayBinary Search | Medium |
| 2862 | Maximum Element-Sum of a Complete Subset of Indices | ArrayMathNumber Theory | Hard |
| 2864 | Maximum Odd Binary Number | MathStringGreedy | Easy |
| 2865 | Beautiful Towers I | ArrayStackMonotonic Stack | Medium |
| 2866 | Beautiful Towers II | ArrayStackMonotonic Stack | Medium |
| 2867 | Count Valid Paths in a Tree | MathDynamic ProgrammingTree+2 | Hard |
| 2869 | Minimum Operations to Collect Elements | ArrayHash TableBit Manipulation | Easy |
| 2870 | Minimum Number of Operations to Make Array Empty | ArrayHash TableGreedy+1 | Medium |
| 2871 | Split Array Into Maximum Number of Subarrays | ArrayGreedyBit Manipulation | Medium |
| 2872 | Maximum Number of K-Divisible Components | TreeDepth-First Search | Hard |
| 2873 | Maximum Value of an Ordered Triplet I | Array | Easy |