2,913 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 2809 | Minimum Time to Make Array Sum At Most x | Hard |
| 2810 | Faulty Keyboard | Easy |
| 2811 | Check if it is Possible to Split Array |
Page 46 of 59
| Medium |
| 2812 | Find the Safest Path in a Grid | Medium |
| 2813 | Maximum Elegance of a K-Length Subsequence | Hard |
| 2815 | Max Pair Sum in an Array | Easy |
| 2816 | Double a Number Represented as a Linked List | Medium |
| 2817 | Minimum Absolute Difference Between Elements With Constraint | Medium |
| 2818 | Apply Operations to Maximize Score | Hard |
| 2824 | Count Pairs Whose Sum is Less than Target | Easy |
| 2825 | Make String a Subsequence Using Cyclic Increments | Medium |
| 2826 | Sorting Three Groups | Medium |
| 2827 | Number of Beautiful Integers in the Range | Hard |
| 2828 | Check if a String Is an Acronym of Words | Easy |
| 2829 | Determine the Minimum Sum of a k-avoiding Array | Medium |
| 2830 | Maximize the Profit as the Salesman | Medium |
| 2831 | Find the Longest Equal Subarray | Medium |
| 2833 | Furthest Point From Origin | Easy |
| 2834 | Find the Minimum Possible Sum of a Beautiful Array | Medium |
| 2835 | Minimum Operations to Form Subsequence With Target Sum | Hard |
| 2836 | Maximize Value of Function in a Ball Passing Game | Hard |
| 2839 | Check if Strings Can be Made Equal With Operations I | Easy |
| 2840 | Check if Strings Can be Made Equal With Operations II | Medium |
| 2841 | Maximum Sum of Almost Unique Subarray | Medium |
| 2842 | Count K-Subsequences of a String With Maximum Beauty | Hard |
| 2843 | Count Symmetric Integers | Easy |
| 2844 | Minimum Operations to Make a Special Number | Medium |
| 2845 | Count of Interesting Subarrays | Medium |
| 2846 | Minimum Edge Weight Equilibrium Queries in a Tree | Hard |
| 2848 | Points That Intersect With Cars | Easy |
| 2849 | Determine if a Cell Is Reachable at a Given Time | Medium |
| 2850 | Minimum Moves to Spread Stones Over Grid | Medium |
| 2851 | String Transformation | Hard |
| 2855 | Minimum Right Shifts to Sort the Array | Easy |
| 2856 | Minimum Array Length After Pair Removals | Medium |
| 2857 | Count Pairs of Points With Distance k | Medium |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard |
| 2859 | Sum of Values at Indices With K Set Bits | Easy |
| 2860 | Happy Students | Medium |
| 2861 | Maximum Number of Alloys | Medium |
| 2862 | Maximum Element-Sum of a Complete Subset of Indices | Hard |
| 2864 | Maximum Odd Binary Number | Easy |
| 2865 | Beautiful Towers I | Medium |
| 2866 | Beautiful Towers II | Medium |
| 2867 | Count Valid Paths in a Tree | Hard |
| 2869 | Minimum Operations to Collect Elements | Easy |
| 2870 | Minimum Number of Operations to Make Array Empty | Medium |
| 2871 | Split Array Into Maximum Number of Subarrays | Medium |
| 2872 | Maximum Number of K-Divisible Components | Hard |
| 2873 | Maximum Value of an Ordered Triplet I | Easy |
© 2026 PhantomCodeAI. All rights reserved.