2,913 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 3074 | Apple Redistribution into Boxes | Easy |
| 3075 | Maximize Happiness of Selected Children | Medium |
| 3076 | Shortest Uncommon Substring in an Array |
Page 50 of 59
| Medium |
| 3077 | Maximum Strength of K Disjoint Subarrays | Hard |
| 3079 | Find the Sum of Encrypted Integers | Easy |
| 3080 | Mark Elements on Array by Performing Queries | Medium |
| 3081 | Replace Question Marks in String to Minimize Its Value | Medium |
| 3082 | Find the Sum of the Power of All Subsequences | Hard |
| 3083 | Existence of a Substring in a String and Its Reverse | Easy |
| 3084 | Count Substrings Starting and Ending with Given Character | Medium |
| 3085 | Minimum Deletions to Make String K-Special | Medium |
| 3086 | Minimum Moves to Pick K Ones | Hard |
| 3090 | Maximum Length Substring With Two Occurrences | Easy |
| 3091 | Apply Operations to Make Sum of Array Greater Than or Equal to k | Medium |
| 3092 | Most Frequent IDs | Medium |
| 3093 | Longest Common Suffix Queries | Hard |
| 3095 | Shortest Subarray With OR at Least K I | Easy |
| 3096 | Minimum Levels to Gain More Points | Medium |
| 3097 | Shortest Subarray With OR at Least K II | Medium |
| 3098 | Find the Sum of Subsequence Powers | Hard |
| 3099 | Harshad Number | Easy |
| 3100 | Water Bottles II | Medium |
| 3101 | Count Alternating Subarrays | Medium |
| 3102 | Minimize Manhattan Distances | Hard |
| 3105 | Longest Strictly Increasing or Strictly Decreasing Subarray | Easy |
| 3106 | Lexicographically Smallest String After Operations With Constraint | Medium |
| 3107 | Minimum Operations to Make Median of Array Equal to K | Medium |
| 3108 | Minimum Cost Walk in Weighted Graph | Hard |
| 3110 | Score of a String | Easy |
| 3111 | Minimum Rectangles to Cover Points | Medium |
| 3112 | Minimum Time to Visit Disappearing Nodes | Medium |
| 3113 | Find the Number of Subarrays Where Boundary Elements Are Maximum | Hard |
| 3114 | Latest Time You Can Obtain After Replacing Characters | Easy |
| 3115 | Maximum Prime Difference | Medium |
| 3116 | Kth Smallest Amount With Single Denomination Combination | Hard |
| 3117 | Minimum Sum of Values by Dividing Array | Hard |
| 3120 | Count the Number of Special Characters I | Easy |
| 3121 | Count the Number of Special Characters II | Medium |
| 3122 | Minimum Number of Operations to Satisfy Conditions | Medium |
| 3123 | Find Edges in Shortest Paths | Hard |
| 3127 | Make a Square with the Same Color | Easy |
| 3128 | Right Triangles | Medium |
| 3129 | Find All Possible Stable Binary Arrays I | Medium |
| 3130 | Find All Possible Stable Binary Arrays II | Hard |
| 3131 | Find the Integer Added to Array I | Easy |
| 3132 | Find the Integer Added to Array II | Medium |
| 3133 | Minimum Array End | Medium |
| 3134 | Find the Median of the Uniqueness Array | Hard |
| 3136 | Valid Word | Easy |
| 3137 | Minimum Number of Operations to Make Word K-Periodic | Medium |
© 2026 PhantomCodeAI. All rights reserved.