2,913 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 2932 | Maximum Strong Pair XOR I | Easy |
| 2933 | High-Access Employees | Medium |
| 2934 | Minimum Operations to Maximize Last Elements in Arrays |
Page 48 of 59
| Medium |
| 2935 | Maximum Strong Pair XOR II | Hard |
| 2937 | Make Three Strings Equal | Easy |
| 2938 | Separate Black and White Balls | Medium |
| 2939 | Maximum Xor Product | Medium |
| 2940 | Find Building Where Alice and Bob Can Meet | Hard |
| 2942 | Find Words Containing Character | Easy |
| 2943 | Maximize Area of Square Hole in Grid | Medium |
| 2944 | Minimum Number of Coins for Fruits | Medium |
| 2945 | Find Maximum Non-decreasing Array Length | Hard |
| 2946 | Matrix Similarity After Cyclic Shifts | Easy |
| 2947 | Count Beautiful Substrings I | Medium |
| 2948 | Make Lexicographically Smallest Array by Swapping Elements | Medium |
| 2949 | Count Beautiful Substrings II | Hard |
| 2951 | Find the Peaks | Easy |
| 2952 | Minimum Number of Coins to be Added | Medium |
| 2953 | Count Complete Substrings | Hard |
| 2954 | Count the Number of Infection Sequences | Hard |
| 2956 | Find Common Elements Between Two Arrays | Easy |
| 2957 | Remove Adjacent Almost-Equal Characters | Medium |
| 2958 | Length of Longest Subarray With at Most K Frequency | Medium |
| 2959 | Number of Possible Sets of Closing Branches | Hard |
| 2960 | Count Tested Devices After Test Operations | Easy |
| 2961 | Double Modular Exponentiation | Medium |
| 2962 | Count Subarrays Where Max Element Appears at Least K Times | Medium |
| 2963 | Count the Number of Good Partitions | Hard |
| 2965 | Find Missing and Repeated Values | Easy |
| 2966 | Divide Array Into Arrays With Max Difference | Medium |
| 2967 | Minimum Cost to Make Array Equalindromic | Medium |
| 2968 | Apply Operations to Maximize Frequency Score | Hard |
| 2970 | Count the Number of Incremovable Subarrays I | Easy |
| 2971 | Find Polygon With the Largest Perimeter | Medium |
| 2972 | Count the Number of Incremovable Subarrays II | Hard |
| 2973 | Find Number of Coins to Place in Tree Nodes | Hard |
| 2974 | Minimum Number Game | Easy |
| 2975 | Maximum Square Area by Removing Fences From a Field | Medium |
| 2976 | Minimum Cost to Convert String I | Medium |
| 2977 | Minimum Cost to Convert String II | Hard |
| 2980 | Check if Bitwise OR Has Trailing Zeros | Easy |
| 2981 | Find Longest Special Substring That Occurs Thrice I | Medium |
| 2982 | Find Longest Special Substring That Occurs Thrice II | Medium |
| 2983 | Palindrome Rearrangement Queries | Hard |
| 2996 | Smallest Missing Integer Greater Than Sequential Prefix Sum | Easy |
| 2997 | Minimum Number of Operations to Make Array XOR Equal to K | Medium |
| 2998 | Minimum Number of Operations to Make X and Y Equal | Medium |
| 2999 | Count the Number of Powerful Integers | Hard |
| 3000 | Maximum Area of Longest Diagonal Rectangle | Easy |
| 3001 | Minimum Moves to Capture The Queen | Medium |
© 2026 PhantomCodeAI. All rights reserved.