2,913 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 2874 | Maximum Value of an Ordered Triplet II | Medium |
| 2875 | Minimum Size Subarray in Infinite Array | Medium |
| 2876 | Count Visited Nodes in a Directed Graph |
Page 47 of 59
| 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 | Easy |
| 2895 | Minimum Processing Time | Medium |
| 2896 | Apply Operations to Make Two Strings Equal | Medium |
| 2897 | Apply Operations on Array to Maximize Sum of Squares | Hard |
| 2899 | Last Visited Integers | Easy |
| 2900 | Longest Unequal Adjacent Groups Subsequence I | Easy |
| 2901 | Longest Unequal Adjacent Groups Subsequence II | Medium |
| 2902 | Count of Sub-Multisets With Bounded Sum | Hard |
| 2903 | Find Indices With Index and Value Difference I | Easy |
| 2904 | Shortest and Lexicographically Smallest Beautiful String | Medium |
| 2905 | Find Indices With Index and Value Difference II | Medium |
| 2906 | Construct Product Matrix | Medium |
| 2908 | Minimum Sum of Mountain Triplets I | Easy |
| 2909 | Minimum Sum of Mountain Triplets II | Medium |
| 2910 | Minimum Number of Groups to Create a Valid Assignment | Medium |
| 2911 | Minimum Changes to Make K Semi-palindromes | Hard |
| 2913 | Subarrays Distinct Element Sum of Squares I | Easy |
| 2914 | Minimum Number of Changes to Make Binary String Beautiful | Medium |
| 2915 | Length of the Longest Subsequence That Sums to Target | Medium |
| 2916 | Subarrays Distinct Element Sum of Squares II | Hard |
| 2917 | Find the K-or of an Array | Easy |
| 2918 | Minimum Equal Sum of Two Arrays After Replacing Zeros | Medium |
| 2919 | Minimum Increment Operations to Make Array Beautiful | Medium |
| 2920 | Maximum Points After Collecting Coins From All Nodes | Hard |
| 2923 | Find Champion I | Easy |
| 2924 | Find Champion II | Medium |
| 2925 | Maximum Score After Applying Operations on a Tree | Medium |
| 2926 | Maximum Balanced Subsequence Sum | Hard |
| 2928 | Distribute Candies Among Children I | Easy |
| 2929 | Distribute Candies Among Children II | Medium |
| 2930 | Number of Strings Which Can Be Rearranged to Contain Substring | Medium |
| 2931 | Maximum Spending After Buying Items | Hard |
© 2026 PhantomCodeAI. All rights reserved.