| 2874 | Maximum Value of an Ordered Triplet II | Array | Medium |
| 2875 | Minimum Size Subarray in Infinite Array | ArrayHash TableSliding Window+1 | Medium |
| 2876 | Count Visited Nodes in a Directed Graph | Dynamic ProgrammingGraphMemoization | Hard |
| 2877 | Create a DataFrame from List | | Easy |
| 2878 | Get the Size of a DataFrame | | Easy |
| 2879 | Display the First Three Rows | | Easy |
| 2880 | Select Data | | Easy |
| 2881 | Create a New Column | | Easy |
| 2882 | Drop Duplicate Rows | | Easy |
| 2883 | Drop Missing Data | | Easy |
| 2884 | Modify Columns | | Easy |
| 2885 | Rename Columns | | Easy |
| 2886 | Change Data Type | | Easy |
| 2887 | Fill Missing Data | | Easy |
| 2888 | Reshape Data: Concatenate | | Easy |
| 2889 | Reshape Data: Pivot | | Easy |
| 2890 | Reshape Data: Melt | | Easy |
| 2891 | Method Chaining | | Easy |
| 2894 | Divisible and Non-divisible Sums Difference | Math | Easy |
| 2895 | Minimum Processing Time | ArrayGreedySorting | Medium |
| 2896 | Apply Operations to Make Two Strings Equal | StringDynamic Programming | Medium |
| 2897 | Apply Operations on Array to Maximize Sum of Squares | ArrayHash TableGreedy+1 | Hard |
| 2899 | Last Visited Integers | ArraySimulation | Easy |
| 2900 | Longest Unequal Adjacent Groups Subsequence I | ArrayStringDynamic Programming+1 | Easy |
| 2901 | Longest Unequal Adjacent Groups Subsequence II | ArrayStringDynamic Programming | Medium |
| 2902 | Count of Sub-Multisets With Bounded Sum | ArrayHash TableDynamic Programming+1 | Hard |
| 2903 | Find Indices With Index and Value Difference I | ArrayTwo Pointers | Easy |
| 2904 | Shortest and Lexicographically Smallest Beautiful String | StringSliding Window | Medium |
| 2905 | Find Indices With Index and Value Difference II | ArrayTwo Pointers | Medium |
| 2906 | Construct Product Matrix | ArrayMatrixPrefix Sum | Medium |
| 2908 | Minimum Sum of Mountain Triplets I | Array | Easy |
| 2909 | Minimum Sum of Mountain Triplets II | Array | Medium |
| 2910 | Minimum Number of Groups to Create a Valid Assignment | ArrayHash TableGreedy | Medium |
| 2911 | Minimum Changes to Make K Semi-palindromes | Two PointersStringDynamic Programming | Hard |
| 2913 | Subarrays Distinct Element Sum of Squares I | ArrayHash Table | Easy |
| 2914 | Minimum Number of Changes to Make Binary String Beautiful | String | Medium |
| 2915 | Length of the Longest Subsequence That Sums to Target | ArrayDynamic Programming | Medium |
| 2916 | Subarrays Distinct Element Sum of Squares II | ArrayDynamic ProgrammingBinary Indexed Tree+1 | Hard |
| 2917 | Find the K-or of an Array | ArrayBit Manipulation | Easy |
| 2918 | Minimum Equal Sum of Two Arrays After Replacing Zeros | ArrayGreedy | Medium |
| 2919 | Minimum Increment Operations to Make Array Beautiful | ArrayDynamic Programming | Medium |
| 2920 | Maximum Points After Collecting Coins From All Nodes | ArrayDynamic ProgrammingBit Manipulation+3 | Hard |
| 2923 | Find Champion I | ArrayMatrix | Easy |
| 2924 | Find Champion II | Graph | Medium |
| 2925 | Maximum Score After Applying Operations on a Tree | Dynamic ProgrammingTreeDepth-First Search | Medium |
| 2926 | Maximum Balanced Subsequence Sum | ArrayBinary SearchDynamic Programming+2 | Hard |
| 2928 | Distribute Candies Among Children I | MathCombinatoricsEnumeration | Easy |
| 2929 | Distribute Candies Among Children II | MathCombinatoricsEnumeration | Medium |
| 2930 | Number of Strings Which Can Be Rearranged to Contain Substring | MathDynamic ProgrammingCombinatorics | Medium |
| 2931 | Maximum Spending After Buying Items | ArrayGreedySorting+2 | Hard |